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: 718 ms):
import java.util.*;

public class cfhello2025B 
{
    public static void main(String[] args) 
    {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int ret[] = new int[n];
        for(int i = 0;i<n;i++)
        {
            int size = sc.nextInt();
            int k = sc.nextInt();
            int temp[] = new int[size];
            Map<Integer,Integer> store = new HashMap<>();
            for(int j = 0;j<size;j++)
            {
                temp[j] = sc.nextInt();
                if(store.containsKey(temp[j]))
                {
                    store.put(temp[j],store.get(temp[j])+1);
                }
                else
                {
                    store.put(temp[j],1);
                }
            }
            PriorityQueue<Integer> occ = new PriorityQueue<>();
            for (Map.Entry<Integer, Integer> entry : store.entrySet()) 
            {
                occ.add(entry.getValue());
            }
            while(k!=0)
            {
                if(occ.size() == 0)
                {
                    break;
                }
                int smallest = occ.poll();
                if(k>=smallest)
                {
                    k-=smallest;
                }
                else
                {
                    occ.add(smallest);
                    break;
                }
            }
            ret[i] = occ.size();
            if(occ.size() == 0)
            {
                ret[i] = 1;
            }
        }
        for(int i = 0;i<ret.length;i++)
        {
            System.out.println(ret[i]);
        }
    }
}