九度oj 题目1196：成绩排序

 1 #include <iostream>
 2 #include <cstdlib>
 3 #include <cstdio>
 4 #include <algorithm>
 5 using namespace std;
 6 
 7 typedef struct{
 8     int p;
 9     int q;
10 }stu;
11 
12 bool cmp(const stu &a, const stu &b){
13     if(a.q != b.q)
14         return a.q < b.q;
15     else
16         return a.p < b.p;
17 }
18 
19 int main(){
20     int n;
21     while(scanf("%d", &n) != EOF){
22         //stu *s = (stu *)malloc(n * sizeof(stu));
23         stu *s = new stu[n];
24         for(int i = 0; i < n; i++){
25             //cin >> s[i].p >> s[i].q;
26             scanf("%d %d", &s[i].p, &s[i].q);
27         }
28         sort(s, s + n, cmp);
29         for(int i = 0; i < n; i++){
30             //cout << s[i].p << " " << s[i].q << endl;
31             printf("%d %d\n", s[i].p, s[i].q);
32         }
33     }
34     //system("pause");
35     return 0;
36 }