View difference between Paste ID: LDTapVBL and YGst2Hmc

 // Author : Saurav Kalsoor
-// Sort By Primes - JAVA
+// Minimize Unique Numbers - JAVA
 
 import java.util.*;
 
 public class Test {
     static Scanner sc = new Scanner(System.in);
     public static void main(String[] args) {
         int n = sc.nextInt();
 		int k = sc.nextInt();
 
         ArrayList<Integer> arr = new ArrayList<>();
 		for(int i = 0;i < n; i++){
-        for(int i=0; i < n; i++) {
+			arr.add(sc.nextInt());
-            int input = sc.nextInt();
+		}
-            arr.add(input);
+
-        }
+		System.out.println(minimizeUnique(arr, k));
     }
-        ArrayList<Integer> result = sortPrimeNonPrime(arr, n);
+
     public static int minimizeUnique(ArrayList<Integer> arr, int k){
-        for(int i=0; i < n; i++)
+		HashMap<Integer, Integer> count = new HashMap<>();
-            System.out.print(result.get(i) + " ");
+
 		for(int num : arr){
-        System.out.println();
+			count.put(num, count.getOrDefault(num, 0) + 1);
 		}
 
-    public static ArrayList<Integer> sortPrimeNonPrime(ArrayList<Integer> arr, int n){
+		Set<MyPair> st = new TreeSet<>(new Comparator<MyPair>() {
 			@Override
-        int maxLimit = 10001;
+			public int compare(MyPair a, MyPair b) {
-        HashSet<Integer> primesSet = new HashSet<>();
+				if(a.second == b.second)
-        boolean[] isPrime = new boolean[maxLimit];
+					return a.first - b.first;
 				return a.second - b.second;
-        for(int i=2; i < maxLimit; i++) isPrime[i] = true;
+			}
 		});
-        for(int i=2; i < maxLimit; i++){
+
-            if(isPrime[i]){
+		for(Map.Entry<Integer, Integer> x : count.entrySet()){
-                primesSet.add(i);
+			st.add(new MyPair(x.getKey(), x.getValue()) );
-                for(int j = i*i ; j < maxLimit; j += i)
+		}
-                    isPrime[j] = false;
+
-            }
+		int res = st.size();
-        }
+
 		for(MyPair x : st){
-        ArrayList<Integer> primes = new ArrayList<Integer>();
+			if(k >= x.second){
-        ArrayList<Integer> nonPrimes = new ArrayList<Integer>();
+				res--;
 				k -= x.second;
-        for(int i=0; i < n; i++){
+			}else{
-            if(primesSet.contains(arr.get(i))){
+				break;
-                primes.add(arr.get(i));
+			}
-            }else{
+		}
-                nonPrimes.add(arr.get(i));
+
-            }
+		return res;
-        }
+
 
-        Collections.sort(primes);
+
-        Collections.sort(nonPrimes, Collections.reverseOrder());
+
 class MyPair{
-        ArrayList<Integer> result = new ArrayList<Integer>();
+	public int first, second;
 
-        int j = 0, k = 0;
+	public MyPair(int first, int second){
-        for(int i=0; i < n; i++){
+		this.first = first;
-            if(primesSet.contains(arr.get(i))){
+		this.second = second;
-                result.add(primes.get(j));
+	}
-                j++;
+
-            }else{
+
-                result.add(nonPrimes.get(k));
+
-                k++;
+