joj2016

2016: Sort the Students

---

Result	TIME Limit	MEMORY Limit	Run Times	AC Times	JUDGE
	3s	8192K	1408	531	Standard

Given the class numbers and the scores of a group of students, you are to write a program to sort the students first by class number in ascending order and then by score in descending order.

Input

The input contains only one test case. The first line of the input contains an integer N(N<=300), indicating the number of students you are to sort. From the second line of the input, there are N lines, each of which contains two integers A_i and B_i, indicating the class number and the score of the i^th student.

Output

The output should contain N lines exactly, which should be sorted first by class number in ascending order and then by score in descending order. Each line of the output should contain two integers A_j and B_j(separated by a space) of the student in position j after sorting.

There shoud be no other information or blank in the output. See the sample output below for more details.

Sample Input

5
2 90
2 89
1 65
3 95
2 95

Sample Output

1 65
2 95
2 90
2 89
3 95

Problem Source: 2nd JLU Programming Contest

---

This problem is used for contest: 6 

---

Submit / Problem List / Status / Discuss

Problem Set with Online Judge System Version 3.12
Jilin University

Developed by skywind, SIYEE

 

 

 

 

 

#include<cstdio>
#include<string.h>
#include<algorithm>
using namespace std;
struct stu
{
    int classs;
    int mark;
};
stu student[301];
bool compare(const stu &a,const stu&b)
{
    return a.classs<b.classs;

}
bool cmp(const stu a,const stu b)
{
    return a.mark>b.mark;
}
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)scanf("%d%d",&student[i].classs,&student[i].mark);
    sort(student+1,student+n+1,compare);
    int count=1;
    for(int i=1;i<=n;i++)
    {
        while(student[i].classs==student[i+1].classs)i++;
        sort(student+count,student+i+1,cmp);
        count=i+1;
    }
    for(int i=1;i<=n;i++)
    {
        printf("%d %d\n",student[i].classs,student[i].mark);
    }
    return 0;
}