View Code of Problem 5

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