#include<stdio.h> int findmax(int value[],int n){ int max=0; for(int i=0;i<n;i++){ if(value[max]<value[i]){ max=i; } } return max; } int main(){ int t,n,m; int basket[100000][2],value[100000]; scanf("%d\n",&t); while(t--){ scanf("%d %d\n",&n,&m); for(int i=0;i<n;i++){ scanf("%d %d\n",&basket[i][0],&basket[i][1]); value[i]=basket[i][0]*100000+basket[i][1]; } for(int i=0;i<m;i++){ if(i==m-1) printf("%d",findmax(value,n)+1); else printf("%d ",findmax(value,n)+1); value[findmax(value,n)]=-1; } printf("\n"); } } |
Double click to view unformatted code.