View Code of Problem 5

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner Sc = new Scanner(System.in);
        int t = Sc.nextInt();

        for (int i = 0; i < t; i++) {
            int n = Sc.nextInt();
            int m = Sc.nextInt();

            int[] apple = new int[n];
            int[] lanzi = new int[n];
            int[] li = new int[n];
            for (int j = 0; j < n; j++) {
                apple[j] = Sc.nextInt();
                li[j] = Sc.nextInt();

                lanzi[j] = j + 1;
            }

            for (int a = 0; a < n - 1; a++) {
                for (int b = a + 1; b < n; b++) {

                    if (apple[a] < apple[b]) {
                        int k = apple[a];
                        apple[a] = apple[b];
                        apple[b] = k;


                        k = lanzi[a];
                        lanzi[a] = lanzi[b];
                        lanzi[b] = k;
                    } else if (apple[a] == apple[b]) {
                        if (li[a] < li[b]) {
                            int k = li[a];
                            li[a] = li[b];
                            li[b] = k;


                            int z = lanzi[a];
                            lanzi[a] = lanzi[b];
                            lanzi[b] = z;
                        }
                    }
                }
            }
            for (int p = 0; p < m; p++) {
                System.out.print(lanzi[p] + " ");



            }

        }
    }
}