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

Solution 1 (runtime: 390 ms):
import java.util.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.ArrayList;
import java.util.Scanner;

public class B_Gorilla_And_The_Exam {

	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);
		int t = input.nextInt();
		for(int test = 0; test < t; test++) {
			int n = input.nextInt();
			int k = input.nextInt();
			HashMap<Integer, Integer> counts = new HashMap<Integer, Integer>();
			for(int i = 0; i < n; i++) {
				int a = input.nextInt();
				int count = counts.getOrDefault(a, 0);
				counts.put(a, count + 1);
			}
			List<Integer> sortedCounts = new ArrayList<Integer>(counts.values());
			Collections.sort(sortedCounts);
			int index = 0;
			while(index < sortedCounts.size() && k >= sortedCounts.get(index)) {
				k -= sortedCounts.get(index);
				index++;
			}
			System.out.println(Math.max(1, sortedCounts.size() - index));
		}
		input.close();
	}

}


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;
    }
}