View Code of Problem 5

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