View Code of Problem 5

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