1 #include <iostream>
 2 #include <algorithm>
 3 #include <math.h>
 4 using namespace std;
 5 struct Can {
 6     int num;
 7     int score;
 8 }can[5001];
 9 bool compare1(Can a, Can b)
10 {
11     return a.score > b.score;
12 }
13 bool compare2(Can a, Can b)
14 {
15     return a.num < b.num;
16 }
17 int n, m;
18 int mline, mscore;
19 int head = 0, tail = 1, mid;
20 int main()
21 {
22     cin >> n >> m;
23     for (int i = 0; i < n; i++) cin >> can[i].num >> can[i].score;
24     sort(can, can + n, compare1);
25     mline = floor(1.5*m);
26     mscore = can[mline - 1].score;
27     for (int i = floor(1.5*m); i < n; i++)
28         if (can[i].score == mscore)
29             mline++;
30     mid = can[0].score;
31     for (int i = 1; i <= mline; i++)
32     {
33         if (can[i].score != mid)
34         {
35             sort(can + head, can + tail + head, compare2);
36             head = head + tail;
37             tail = 1;
38             mid = can[head].score;
39         }
40         else tail++;
41     }
42     cout << mscore << " " << mline << endl;
43     for (int i = 0; i < mline; i++)
44         cout << can[i].num << " " << can[i].score << endl;
45     return 0;
46 }

 1 bool compare(example x, example y)
 2 {　　
 3 return x.a<y.a;
 4 //<升序，>降序
 5 }
 6 
 7 struct example
 8 {
 9 int a,b;
10 }ex[n];
11 
12 sort(ex, ex+n, compare);

 1 struct Can {
 2     int num;
 3     int score;
 4 }can[5001];
 5 int cmp(Can a, Can b){
 6     if(a.score>b.score){
 7                     //比成绩
 8         return true;
 9     }
10     else if(a.score==b.score){
11         if(a.num<b.num)return true;
12                     //比较考号
13         else return false;
14     }
15     else return false;
16 }      

1 int p[7]={9,8,7,6,5,4,3};
2 sort(p+1,,p+7);//结果{9,3,4,5,6,7,8}
3 sort(p+1,p+6);//结果{9,4,5,6,7,8,3}
4 sort(p+2,p+4);//结果{9,8,6,7,5,4,3}