你准备好了吗？

Problem Description

Is this your first times participating in this kind of contest? I think most of you will answer “Yes”. So let’s do this problem as warm-up and check whether the PC^2 work properly.
Now, we will give you the information of some contests that are just like the one you are taking. Your task is to output their rank lists according to the contest rules you have already understood.

Input

There is only one number C (<=100) in the first line of the input, which is the number of contests.
For each contest, the first line contains only one number N indicating the total number of teams. And then follow N lines. Each line has three numbers Ti, Si and Pi (1<=Ti<=N, 0<=Si<=20, 0<=Pi<=10000), which stand for the ID, Score and Penalty of the ith team of the contest respectively. Specially, all teams’ scores are distinct.

Output

For each contest, you should output the rank list (team ID) in descent order in just one line. Numbers separate exactly one space.

Sample Input

2
3
3 2 200
2 1 100
1 3 300
2
1 2 222
2 1 222

Sample Output

1 3 2
1 2

Author

HYNU 

代码：

#include<stdio.h>
#include<malloc.h>
#include<algorithm>
#include<iostream>
using namespace std;
struct pc
{
   int a;// 编号 
   int b;// 总和 
}*x;
bool mcp(pc b1,pc b2)
{
   return b1.b>b2.b;
}
int main()
{
   int n,t,i,c1,c2;
   scanf("%d",&t);
   while(t--)
   {
      scanf("%d",&n);
      x=(pc *)malloc(sizeof(pc)*n);// 动态开辟一个数结构体数组x[n] 
      for(i=0;i<n;i++)
        {
           scanf("%d%d%d",&x[i].a,&c1,&c2);
           x[i].b=c1+c2;
        }
      sort(x,x+n,mcp);// 调用系统排序函数 从大到小排序 
      for(i=0;i<n;i++)
        if(i==0)printf("%d",x[i].a);
        else printf(" %d",x[i].a);
      if(t!=0)printf("\n");
   } 
   return 0;
}