View difference between Paste ID: hv6ejyib and LDTapVBL

 // Author : Saurav Kalsoor
-// Minimize Unique Numbers - JAVA
+// Basket Full of Balls - JAVA
 
 
 import java.util.*;
 
 public class Test {
 
-        int n = sc.nextInt();
+
 
     public static void main(String[] args) {
-        ArrayList<Integer> arr = new ArrayList<>();
+    	int n = sc.nextInt();
-		for(int i = 0;i < n; i++){
+
 
 		ArrayList<Integer> arr = new ArrayList<>();
-
+		for(int i=0; i < n ;i++){
-		System.out.println(minimizeUnique(arr, k));
+
 		}
 
-    public static int minimizeUnique(ArrayList<Integer> arr, int k){
+		System.out.println(bucketFullOfBalls(n, k, arr));
     }
 
-		for(int num : arr){
+	public static int bucketFullOfBalls(int n, int k, ArrayList<Integer> arr){
-			count.put(num, count.getOrDefault(num, 0) + 1);
+
 		for(int x : arr){
 			count.put(x, count.getOrDefault(x, 0) + 1);
-		Set<MyPair> st = new TreeSet<>(new Comparator<MyPair>() {
+
-			@Override
+
-			public int compare(MyPair a, MyPair b) {
+		ArrayList<Integer> temp = new ArrayList<>();
-				if(a.second == b.second)
+		for(Map.Entry<Integer, Integer> m : count.entrySet()){
-					return a.first - b.first;
+			if(m.getValue() >= k){
-				return a.second - b.second;
+				temp.add(m.getKey());
 			}
-		});
+
 
-		for(Map.Entry<Integer, Integer> x : count.entrySet()){
+		int m = temp.size();
-			st.add(new MyPair(x.getKey(), x.getValue()) );
+		if(m == 0){
-		}
+			return -1;
 		}
-		int res = st.size();
+
 
-		for(MyPair x : st){
+
-			if(k >= x.second){
+		int l = temp.get(0), r = l, i = 1;
-				res--;
+		while(i < m){
-				k -= x.second;
+			int j = i - 1;
-			}else{
+			while(i < m && temp.get(i) == temp.get(i-1) + 1){
-				break;
+				i++;
 			}
 			i--;
 
-		return res;
+			if(temp.get(i) - temp.get(j) > r - l){
 				l = temp.get(j);
 				r = temp.get(i);
 			}
 
-class MyPair{
+			i+=2;
-	public int first, second;
+
 
-	public MyPair(int first, int second){
+		return r - l;
-		this.first = first;
+
-		this.second = second;
+