View Code of Problem 5

import java.util.Scanner;
public class Main {
	public static void main(String[] args) {	
		int m,n,t,max_a,max_l,index=0;
		Scanner scan = new Scanner(System.in);
		t = scan.nextInt();
		int[][] a;

		for(int k=0;k<t;k++) {
			n = scan.nextInt(); 
			m = scan.nextInt();
			a = new int[n][2];
			for(int j=0;j<n;j++) {
				a[j][0] = scan.nextInt();
				a[j][1] = scan.nextInt();
			}

			for(int j=0;j<m;j++) {
				max_a = a[0][0];
				max_l = a[0][1];
				for(int i=1;i<n;i++) {
					if(a[i][0] > max_a) {
						max_a = a[i][0];
						max_l = a[i][1];
						index = i;
					}else if(a[i][0] == max_a && a[i][1] > max_l) {
						max_a = a[i][0];
						max_l = a[i][1];
						index = i;
					}
				}
				if(j != (m-1)) {
					System.out.print(index+1+" ");
				}else if(j == (m-1) && k!= (t-1)){
					System.out.println(index+1);
				}else {
					System.out.print(index+1);
				}
				a[index][0] = 0;
				a[index][1] = 0;
				index = 0;
			}
		}
		scan.close();
		}
}