View Code of Problem 5

#include<iostream>
#include<algorithm>
using namespace std;

struct node{
	int id;
	int num;
	
}a[100001];

bool cmp(node x,node y){
	
	return x.num>y.num;
} 

int main(){
	int t;
	cin>>t;
	while(t--){
		long long m,n,x,y;
		cin>>m>>n;
		for(int i=0;i<m;i++){
			cin>>x>>y;
			a[i].id=i;
			a[i].num=x*9999+y;
		}
		sort(a,a+m,cmp);
		for(int i=0;i<n;i++){
			if(i!=n-1)
			cout<<a[i].id+1<<" ";
			else cout<<a[i].id+1<<endl;
		}
			
		
	}
	
	
	return 0;
} 

Double click to view unformatted code.


Back to problem 5