View Code of Problem 5

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