九度 1339 ACM

http://ac.jobdu.com/problem.php?id=1339

 1 #include <stdio.h>
2 #include <string.h>
3 #include <stdlib.h>
4 #include <algorithm>
5 using namespace std;
6 int N;
7 typedef struct Team{
8 char name[102];
9 int num;
10 int punish;
11 }Team;
12 Team t[100];
13
14 bool cmp(Team a,Team b)
15 {
16 if(a.num!=b.num)
17 return a.num>b.num;
18 else if(a.punish!=b.punish)
19 return a.punish<b.punish;
20 else return strcmp(a.name,b.name)<0;
21 }
22
23 int main()
24 {
25 while(scanf("%d",&N)!=EOF){
26 int i;
27 for(i=0;i<N;i++)
28 scanf("%s%d%d",&t[i].name,&t[i].num,&t[i].punish);
29 sort(t,t+N,cmp);
30 for(i=0;i<N;i++)
31 printf("%s\n",t[i].name);
32 }
33 }



原文地址:https://www.cnblogs.com/yangce/p/2264348.html