View Code of Problem 5

#include<stdio.h>
struct fruit{
	int pear;
	int peach;
}; 
int main()
{
	int t,n,m,i,j=0;
	scanf("%d",&t);
	while(t--)
	{
		int s=0;
		scanf("%d %d",&n,&m);
		struct fruit a[n];
		for(i=0;i<n;i++)
		{
			scanf("%d %d",&a[i].pear,&a[i].peach);
		}
		while(m--)
		{
			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;
			s++;
		    printf("%d",k+1); 
		    if(s<n)
		        printf(" "); 
		}	
		printf("\n");
	}
	return 0;
}

Double click to view unformatted code.


Back to problem 5