Happy Three Friends

Dong-hao , Grandpa Shawn , Beautful-leg Mzry are good friends. One day , they want to play a game.

There are 6 numbers on the table.

Firstly , Dong-hao can change the order of 6 numbers.

Secondly , Grandpa Shawn take the first one and the last one , sum them up as his scores.

Thirdly , Beautiful-leg Mzry take any of 3 numbers from the last 4 numbers , and sum them up as his scores.

Finally , if Grandpa Shawn‘s score is larger than Beautiful-leg Mzry‘s , Granpa Shawn wins!

If Grandpa Shawn‘s score is smaller than Beautiful-leg Mzry‘s , Granpa Shawn loses.

If the scores are equal , there is a tie.

Nowadays , it‘s really sad that Grandpa Shawn loses his love. So Dong-hao wants him to win(not even tie). You have to tell Dong-hao whether he can achieve his goal.

There is a number T shows there are T test cases below. ( T <= 50)

For each test case , there are 6 numbers Ai ( 1 <= Ai <= 100 ).

If Dong-hao can achieve his goal , output "Grandpa Shawn is the Winner!"
If he can not , output "What a sad story!"

3

1 2 3 3 2 2

2 2 2 2 2 2

1 2 2 2 3 4

What a sad story!

What a sad story!

Grandpa Shawn is the Winner!

 

 1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <cmath> 5 #include <algorithm> 6 #include <climits> 7 #include <vector> 8 #include <queue> 9 #include <cstdlib>10 #include <string>11 #include <set>12 #include <stack>13 #define LL long long14 #define INF 0x3f3f3f3f15 using namespace std;16 int d[8],n;17 int main() {18     int t,i,j,grapa,mzry;19     scanf("%d",&t);20     while(t--){21         for(i = 0;i < 6; i++)22             scanf("%d",d+i);23         sort(d,d+6);24         grapa = d[5]+d[4];25         mzry = d[3]+d[2]+d[1];26         if(grapa > mzry){27             puts("Grandpa Shawn is the Winner!");28         }else puts("What a sad story!");29     }30     return 0;31 }