View Code of Problem 5

#include<stdio.h>
int main()
{
    int t,m,n,a[1000],b[1000],i,j,k,max;
    scanf("%d",&t);

    for(i=0;i<t;i++)
    {
        scanf("%d%d",&n,&m);
       for(j=0;j<n;j++)
       {
            scanf("%d%d",&a[j],&b[j]);
       }
       max=0;
       for(k=0;k<m;k++)
       {
           for(j=0;j<n;j++)
           {
               if(a[j]>a[max])
               {
                   max=j;
               }
               if(a[j]==a[max]&&b[j]>b[max])
               {
                   max=j;
               }
           }
         if(k==m-1)
            printf("%d",max+1);
         else
            printf("%d ",max+1);
            a[max]=0;
            b[max]=0;
       }
       printf("\n");
    }
}

Double click to view unformatted code.


Back to problem 5