View difference between Paste ID: tzxz793v and LDTapVBL

 // Author : Saurav Kalsoor
-// Minimize Unique Numbers - JAVA
+// Partition - 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();
+        int k = sc.nextInt();
         int x = sc.nextInt();
 
-		for(int i = 0;i < n; i++){
+
-			arr.add(sc.nextInt());
+        for(int i = 0;i < n; i++){
-		}
+            arr.add(sc.nextInt());
         }
-		System.out.println(minimizeUnique(arr, k));
+
         System.out.println(partition(n, k, x, arr));
     }
-    public static int minimizeUnique(ArrayList<Integer> arr, int k){
+
-		HashMap<Integer, Integer> count = new HashMap<>();
+    public static int partition(int n, int k, int x, ArrayList<Integer> arr){
         Collections.sort(arr);
-		for(int num : arr){
+        int count = 1;
-			count.put(num, count.getOrDefault(num, 0) + 1);
+        PriorityQueue<Integer> pq = new PriorityQueue<>();
-		}
+        int i = 1;
         while(i < n){
-		Set<MyPair> st = new TreeSet<>(new Comparator<MyPair>() {
+            int diff = arr.get(i) - arr.get(i-1);
-			@Override
+            if(diff > k){
-			public int compare(MyPair a, MyPair b) {
+                count++;
-				if(a.second == b.second)
+                pq.offer(diff);
-					return a.first - b.first;
+            }
-				return a.second - b.second;
+            i++;
-			}
+        }
-		});
+
         while(!pq.isEmpty() && x > 0){
-		for(Map.Entry<Integer, Integer> x : count.entrySet()){
+            int diff = pq.poll();
-			st.add(new MyPair(x.getKey(), x.getValue()) );
+            int req = (diff - 1)/k;
-		}
+            if(x >= req){
                 x -= req;
-		int res = st.size();
+                count--;
             }else{
-		for(MyPair x : st){
+                break;
-			if(k >= x.second){
+            }
-				res--;
+        }
-				k -= x.second;
+
-			}else{
+        return count;
-				break;
+
-			}
+
-		}
+
 
-		return res;
+