SDUT 2446 final ranking

Time Limit: 1000 ms Memory Limit: 65536 KiB

Problem Description

The 4th Shandong University of Technology ACM After the network programming arena competition, a final ranking needs to be generated , The ranking depends on the number of questions . But there are too many teams involved , Manual ranking calculation can no longer meet the needs of the game . Now there's a list of teams ID And the number of questions made , You need to write a program , Generate the final ranking .
To simplify the topic , The ranking rule here is ： The team with a large number of questions is at the front , If the number of questions is equal , Keep the relative order of input and don't change . Input
The first line contains a positive integer T( 1 ≤ T ≤ 15), Express T Group test data . The first row of each set of data has a positive integer N（1 < N ≤
10000）, Indicates the number of teams . Next N Line contains two integers ,1 ≤ ID ≤ 10^7, 0 ≤ M ≤
100.ID Number the team ,M The number of questions made for .

Output

Each set of data output contains N That's ok , The first i Line has two integers ,ID and M Means to be in the i A team of ID And the number of questions made .

Sample Input

1

8

1 2

16 3

11 2

20 3

3 5

26 4

7 1

22 4

Sample Output

3 5

26 4

22 4

16 3

20 3

1 2

11 2

7 1

Hint

Source

#include <iostream>
#include <algorithm>
using namespace std;
struct s{
    
	int a,b,c;
};
int c(s a,s b)
{
    
	if(a.b==b.b){
    
		return a.c<b.c;
	}
	return a.b>b.b;
}
int main()
{
    
    int n;
    cin>>n;
    while(n--)
    {
    
    	int m;
    	cin>>m;
    	s s[m];
    	for(int i=0;i<m;i++)
    	{
    
    		cin>>s[i].a>>s[i].b;
    		s[i].c=i;
		}
		sort(s,s+m,c);
		for(int i=0;i<m;i++)
		{
    
			cout<<s[i].a<<" "<<s[i].b<<endl;
		}
	}
	return 0; 
}