View Code of Problem 5

import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner=new Scanner(System.in);
        int t=Integer.parseInt(scanner.nextLine());
        for(int i=0;i<t;i++){
            int n=scanner.nextInt();
            int m=scanner.nextInt();
            int[][] ans=new int[n][3];
            for(int j=0;j<n;j++){
                ans[j][0]=scanner.nextInt();
                ans[j][1]=scanner.nextInt();
                ans[j][2]=j+1;
            }
            Arrays.sort(ans, new Comparator<int[]>() {
                @Override
                public int compare(int[] o1, int[] o2) {
                    if(o1[0]==o2[0]){
                        if(o1[1]==o2[1]){
                            return o1[2]-o2[2];
                        }
                        return o2[1]-o1[1];
                    }
                    return o2[0]-o1[0];
                }
            });
            for(int j=0;j<m;j++){
                if(j==0){
                    System.out.print(ans[j][2]);
                }
                else{
                    System.out.print(" "+ans[j][2]);
                }
            }
            System.out.println();
        }
    }
}

Double click to view unformatted code.


Back to problem 5