View Code of Problem 5

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int T = scanner.nextInt();
        while(T-- > 0){
            int n = scanner.nextInt();
            int m = scanner.nextInt();
            int[] apples = new int[n];
            int[] pears = new int[n];
            for (int i = 0; i < n; i++) {
                apples[i] = scanner.nextInt();
                pears[i] = scanner.nextInt();
            }
            int[] res = new int[m];
            for (int i = 0; i < m; i++) {
                int index = 0;
                for (int j = 0; j < n; j++) {
                    if (apples[index] < apples[j]){
                        index = j;
                    }else if(apples[index] == apples[j]){
                        if (pears[index] < pears[j])index = j;
                    }
                }
                apples[index] = -1;
                res[i] = index+1;
            }
            for (int i = 0; i < res.length; i++) {
                if (i == res.length-1) System.out.println(res[i]);
                else{
                    System.out.print(res[i]+" ");
                }
            }
        }
    }
}