View Code of Problem 5

#include <stdio.h>
int main(){
	int t,m,n,apple[1000],pear[1000];
	int max,flag;
	flag=0;
	scanf("%d",&t);
	while(t--){
		scanf("%d %d",&n,&m);
		for(int i=0;i<n;i++){
			scanf("%d %d",&apple[i],&pear[i]);
		}
		while(m--){
			max=0;
			for(int i=0;i<n;i++){
				if(apple[i]>apple[max]){
					max=i;
					flag=1;
				}
				else if(apple[i]==apple[max]){
					if(pear[i]>pear[max]){
						max=i;
						flag=1;
					}
				}		
			}	
			apple[max]=0;
			pear[max]=0;
			if(m>1){
				printf("%d ",max+1);
			}
			else
				printf("%d",max+1);
		}
		printf("\n");
	}
	return 0;
}