Problem: 2057B - Gorilla and the Exam
Language: java

Solution 1 (runtime: 858 ms):

import java.sql.SQLOutput;
import java.util.*;

public class Main {
    public static Scanner sc = new Scanner(System.in);

    public static void no() {
        System.out.println("NO");
        return;
    }

    public static void yes() {
        System.out.println("YES");
        return;
    }

    public static void array_input(int[] arr, int size) {
        for (int i = 0; i < size; i++) {
            arr[i] = sc.nextInt();
        }
    }

    public static void array_output(int[] arr) {
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i] + " ");
        }
    }

    public static void matrix_input(int[][] arr, int rows, int colm) {
        for (int i = 0; i < rows; i++) {
            for (int j = 0; j < colm; j++) {
                arr[i][j] = sc.nextInt();
            }
        }
    }

    public static void matrix_output(int[][] arr) {
        for (int i = 0; i < arr.length; i++) {
            for (int j = 0; j < arr[0].length; j++) {
                System.out.print(arr[i][j]);
            }
        }
    }

//main code starts from line 43


    // main code starts from here
    public static int mex(int[] arr) {
        Arrays.sort(arr);
        int ans = 0;
        for (int i = 0; i < arr.length; i++) {
            if (arr[i] == ans) {
                ans++;
            }
        }
        return ans;
    }
    public static int isBalanced(int [] arr){
        int ans=0;
        if(arr.length==0 || arr.length==1){ans=1;}
        else{
            if(arr.length%2==0 && arr[arr.length/2]==1){
                ans=1;
            }
            else{
                if(arr[(arr.length/2)-1]==0 && arr[(arr.length/2)]==1){
                    ans=1;
                }
                else if(arr[(arr.length/2)+1]==1 && arr[(arr.length/2)]==0){
                    ans=1;
                }
            }
        }
        return ans;
    }


    public static void main(String[] args) {

        int t = sc.nextInt();
        while (t-- > 0) {
            int n = sc.nextInt();
            int k=sc.nextInt();
            int []a=new int[n];
            array_input(a,n);
            Arrays.sort(a);
            ArrayList<Integer> fq=new ArrayList<>();
            int count = 1;

            // Iterate through the list to count frequencies
            for (int i = 0; i < n; i++) {
                if (i + 1 < n && a[i]==a[i+1]){
                    count++;
                } else {
                    fq.add(count);
                    count = 1;
                }
            }
            Collections.sort(fq);
            
            int l=0;
            while (!fq.isEmpty()){
                if(k>=fq.get(l)){

                    k=k-fq.get(l);
                    fq.remove(l);

                }
                else break;
            }


            if(fq.isEmpty()){
                System.out.println("1");
            }
            else {
                System.out.println(fq.size());
            }





            


            


        }


    }
}



Solution 2 (runtime: 421 ms):
import java.io.*;
import java.util.*;

public class GorillaExam {
    static int mint = (int) 1e6 + 7;
    static int mod_i = (int) 1e9 + 7;
    static long mod_l = (long) 1e12 + 7;
    public static void main(String[] args) throws IOException {
        //Scanner sc = new Scanner(System.in);
        Kattio io = new Kattio(System.in, System.out);
        int t = io.getInt();
        for (int i = 0; i < t; i++) {
            int n = io.getInt();
            int k = io.getInt();
            Map<Integer, Integer> hm = new TreeMap<>();
            for (int j = 0; j < n; j++) {
                int temp = io.getInt();
                hm.put(temp, hm.getOrDefault(temp, 0)+1);
            }
            List<Integer> cnt = new ArrayList<>(hm.values());
            Collections.sort(cnt);
//            System.out.println(cnt);
            for(int j=0;j<cnt.size();j++){
//                System.out.println(cnt.get(j)+" "+k);
                int affect = Math.min(cnt.get(j), k);
                cnt.set(j, cnt.get(j)-affect);
                k-=affect;
            }
//            System.out.println(cnt);
            int ans = 0;
            for (int val: cnt) {
                if(val!=0) ans++;
            }
//            System.out.println(ans);
            System.out.println(ans==0?1:ans);
        }
        io.close();
    }
}
class Pair {
    int x;
    long y;
    public Pair(int x, long y) {
       this.x = x;
       this.y = y;
    }
}
class Tuple {
    int x;
    long y;
    int z;
    public Tuple(int x, long y, int z) {
       this.x = x;
       this.y = y;
       this.z = z;
    }
}
class Kattio extends PrintWriter {
    public Kattio(InputStream i) {
        super(new BufferedOutputStream(System.out));
        r = new BufferedReader(new InputStreamReader(i));
    }
    public Kattio(InputStream i, OutputStream o) {
        super(new BufferedOutputStream(o));
        r = new BufferedReader(new InputStreamReader(i));
    }


    public boolean hasMoreTokens() {
        return peekToken() != null;
    }

    public int getInt() {
        return Integer.parseInt(nextToken());
    }

    public double getDouble() {
        return Double.parseDouble(nextToken());
    }

    public long getLong() {
        return Long.parseLong(nextToken());
    }

    public String getWord() {
        return nextToken();
    }


    private BufferedReader r;
    private String line;
    private StringTokenizer st;
    private String token;

    private String peekToken() {
        if (token == null)
            try {
                while (st == null || !st.hasMoreTokens()) {
                    line = r.readLine();
                    if (line == null) return null;
                    st = new StringTokenizer(line);
                }
                token = st.nextToken();
            } catch (IOException e) { }
        return token;
    }

    private String nextToken() {
        String ans = peekToken();
        token = null;
        return ans;
    }
}