九度 1346 会员积分排序
http://ac.jobdu.com/problem.php?id=1346
1 #include <stdio.h>
2 #include <algorithm>
3 using namespace std;
4 struct Cus{
5 int id,s;
6 };
7
8 struct Cus cu[1002];
9 bool cmp(struct Cus a,struct Cus b)
10 {
11 if(a.s!=b.s)
12 return a.s>b.s;
13 return a.id<b.id;
14 }
15 int min(int a,int b)
16 {
17 return a<b?a:b;
18 }
19 int main()
20 {
21 int n,m;
22 while(scanf("%d%d",&n,&m)!=EOF){
23 int i;
24 for(i=0;i<n;i++)
25 scanf("%d%d",&cu[i].id,&cu[i].s);
26 sort(cu,cu+n,cmp);
27 for(i=0;i<min(m,n);i++)
28 printf("%d\n",cu[i].id);
29 }
30 }
