http://acm.hdu.edu.cn/showproblem.php?pid=1236
学会怎样按字典序排序的模板。
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 14043 Accepted Submission(s): 5172
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59 |
#include<iostream>#include<algorithm>using
namespace std;struct
fengshu{ char
str[50]; int
percent;}xue[3001];bool
cmp(fengshu a,fengshu b){ if(a.percent == b.percent) return
strcmp(a.str, b.str) < 0 ? 1 : 0; //按字典序升序 else return
a.percent > b.percent; }int
main(){ int
n,m,g,i,j,t,ans; int
ti[20],shu[20],sum; while(scanf("%d",&n)&&n) { ans=0; cin>>m>>g; if(n==0) break; for(i=0;i<m;i++) cin>>ti[i]; for(i=0;i<n;i++) { sum=0; scanf("%s",xue[i].str); scanf("%d",&t); for(j=0;j<t;j++) { scanf("%d",&shu[j]); sum+=ti[shu[j]-1]; } xue[i].percent=sum; } sort(xue, xue+ n, cmp); for(i=0;i<n;i++) { if(xue[i].percent>=g) ans++; } cout<<ans<<endl; for(i=0;i<n;i++) { if(xue[i].percent>=g) printf("%s %d\n",xue[i].str,xue[i].percent); } } return
0;} |
原文：http://www.cnblogs.com/cancangood/p/3562088.html