View Code of Problem 5

#include<iostream>
#include<algorithm>
using namespace  std;
struct basket {
	int apple;
	int pear;
};
bool cmp(basket a,basket b){
	
	if(a.apple==b.apple){
		return a.pear>b.pear;
	}
	else{
		return a.apple>b.apple;
	}
	
	
}
int main(){
	int t;
	
	scanf("%d",&t);
	int x;
	for(x=0;x<t;x++){
		int n,m;
		scanf("%d %d",&n,&m);
		basket arr[n],arr2[n];
		int i,j;
		for(i=0;i<n;i++){
			scanf("%d %d",&arr[i].apple,&arr[i].pear);
			arr2[i].apple=arr[i].apple;
			arr2[i].pear=arr[i].pear;
		}
		sort(arr,arr+n,cmp);
		int k=0;
		for(j=0;j<m;j++){
		
			for(i=0;i<n;i++){
				if(arr[k].apple==arr2[i].apple&&arr[k].pear==arr2[i].pear){
					printf("%d ",i+1);
					k++;
					break;
				}
			}
		}


		printf("\n");
	}
	
	
	return 0;
}