View Code of Problem 5

#include <stdio.h>
int main()
{
	int t,n,m,i,max;
	int apple[1000],pear[1000]; 
	scanf("%d",&t);//t组数据
	while(t>0)
	{
		scanf("%d %d",&n,&m); //篮子数和选择数
		for(i=0;i<n;i++)
		{
			scanf("%d %d",&apple[i],&pear[i]);
		}
		while(m>0)
		{
			max=0;
			for(i=0;i<n;i++)
			{
				if(apple[i]>apple[max])
				{
					max=i;
				}
				else if(apple[i]==apple[max])
				{
					if(pear[i]>pear[max])
					{
						max=i;
					}
				}
			}
			
				printf("%d",max+1);
			
			apple[max]=0;
			pear[max]=0;
			m--;
		}
		printf("\n");
		t--;
	} 
	return 0;
}

Double click to view unformatted code.


Back to problem 5