View Code of Problem 5

#include <stdio.h>

int max(int v[],int n)
{
	int m,i;
	m = 0;
	for (i=1;i<n;i++)
	    if (v[i]>v[m])
	        m = i;
	return m;
}
int main ()
{
	int t,n,m,i,v[10000],a[10000][2],b[10000][2];
	
	scanf ("%d",&t);
	while (t--){
		scanf ("%d%d",&n,&m);
		for (i=0;i<n;i++){
			scanf ("%d%d",&a[i][0],&a[i][1]);
			v[i] = a[i][0]*10000+a[i][1];
		}
		for (i=0;i<m;i++){
			if (i==m-1)
			printf ("%d\n",max(v,n)+1);
			else printf ("%d ",max(v,n)+1);
			v[max(v,n)] = -1;
		}
	}
	return 0;
}