View Code of Problem 5

#include<stdio.h>
struct fruit{
	int pear;
	int peach;
}; 
int main()
{
	int t,n,m,i,j;
	scanf("%d",&t);
	if(t<=10)
		while(t--)
		{
			int s=0;
			scanf("%d %d",&n,&m);
			if(m>n||m<0||n>100000)
			    printf("Error!");
			else
			{
				struct fruit a[n];
				for(i=0;i<n;i++)
				{
					scanf("%d %d",&a[i].pear,&a[i].peach);
				}
				for(j=0;j<m;j++)
				{
					int x=0,k;
					for(k=i=0;i<n-1;i++)//i<2
				    {
		                if(a[k].pear<a[i+1].pear)
		                	k=i+1;
						else if(a[k].pear>a[i+1].pear)
							k=k;
						else if(a[k].pear==a[i+1].pear)
						{
							if(a[k].peach<a[i+1].peach)
							    k=i+1;
							else if(a[k].peach>a[i+1].peach)
							    k=k;
							else
							    k=k;
						}
				    }
					a[k].pear=0;a[k].peach=0;
				    printf("%d",k+1);  
				    s++;
				    if(s<m)
				      printf(" ");
				}	
				printf("\n");
			}
		}
	return 0;
}

Double click to view unformatted code.


Back to problem 5