View Code of Problem 5

#include<iostream>
#include<algorithm>
using namespace std;
struct node{
	int a;
	int b;
	int id;
	int sum;
}f[100000]; 
bool cmp1(node x,node y){
	return x.sum>y.sum;
}

int main(){
	int t;
	cin>>t;
	while(t--){
		int n,m;
		cin>>n>>m;
		for(int i=0;i<n;i++){
			cin>>f[i].a>>f[i].b; 
			f[i].id=i+1;
			f[i].sum=f[i].a*100000+f[i].b;
		}
		sort(f,f+n,cmp1);
		
		for(int i=0;i<m;i++){
			if(i==m-1)	cout<<f[i].id<<endl;
			else cout<<f[i].id<<" ";

		}
		
	} 
	return 0;
}