View Code of Problem 5

#include<stdio.h>
int main()
{
    int num;
    scanf("%d",&num);
    while(num--)
    {
        int n,m,max,maxp,i;
        scanf("%d%d",&n,&m);
        int apple[n],pear[n];
        for(i=0;i<n;i++)
            scanf("%d%d",&apple[i],&pear[i]);
        while(m--)
        {
            max=apple[0];maxp=0;
            for(i=1;i<n;i++)
            {
               if(apple[i]>max||(apple[i]==max&&pear[i]>pear[maxp]))
               {
                  max=apple[i];
                  maxp=i;
               }
            }
            if(m>=1)
               printf("%d ",maxp+1);
            else
               printf("%d",maxp+1);
            apple[maxp]=-1;
            pear[maxp]=-1;
        }
        printf("\n");
    }
    return 0;
}

Double click to view unformatted code.


Back to problem 5