View Code of Problem 5

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

Double click to view unformatted code.


Back to problem 5