View difference between Paste ID: JaufmpZH and LDTapVBL

 // Author : Saurav Kalsoor
-// Minimize Unique Numbers - JAVA
+// Count Quadruplets - 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 m = sc.nextInt();
         int p = sc.nextInt();
-        ArrayList<Integer> arr = new ArrayList<>();
+        int q = sc.nextInt();
         int target = sc.nextInt();
-			arr.add(sc.nextInt());
+
         ArrayList<Integer> a = new ArrayList<>();
         ArrayList<Integer> b = new ArrayList<>();
-		System.out.println(minimizeUnique(arr, k));
+        ArrayList<Integer> c = new ArrayList<>();
         ArrayList<Integer> d = new ArrayList<>();
 
-    public static int minimizeUnique(ArrayList<Integer> arr, int k){
+
-		HashMap<Integer, Integer> count = new HashMap<>();
+			a.add(sc.nextInt());
 		}
-		for(int num : arr){
+
-			count.put(num, count.getOrDefault(num, 0) + 1);
+        for(int i = 0;i < m; i++){
 			b.add(sc.nextInt());
 		}
-		Set<MyPair> st = new TreeSet<>(new Comparator<MyPair>() {
+
-			@Override
+        for(int i = 0;i < p; i++){
-			public int compare(MyPair a, MyPair b) {
+			c.add(sc.nextInt());
-				if(a.second == b.second)
+
-					return a.first - b.first;
+
-				return a.second - b.second;
+        for(int i = 0;i < q; i++){
-			}
+			d.add(sc.nextInt());
-		});
+
 		System.out.println(countQuadruplets(a, b, c, d, target));
-		for(Map.Entry<Integer, Integer> x : count.entrySet()){
+
-			st.add(new MyPair(x.getKey(), x.getValue()) );
+
-		}
+    public static int countQuadruplets(ArrayList<Integer> a, ArrayList<Integer> b, ArrayList<Integer> c, ArrayList<Integer> d, int target) {
         HashMap<Integer, Integer> map = new HashMap<>();
-		int res = st.size();
+
         for (int i : a) {
-		for(MyPair x : st){
+            for (int j : b) {
-			if(k >= x.second){
+                if (map.containsKey(i + j)) {
-				res--;
+                    map.put(i + j, map.get(i + j) + 1);
-				k -= x.second;
+                } else
-			}else{
+                    map.put(i + j, 1);
-				break;
+            }
-			}
+        }
 
         int count = 0;
-		return res;
+
         for (int i : c) {
             for (int j : d) {
                 if (map.containsKey(target - i - j)) {
                     count += map.get(target - i - j);
-class MyPair{
+                }
-	public int first, second;
+            }
         }
-	public MyPair(int first, int second){
+
-		this.first = first;
+        return count;
-		this.second = second;
+
-	}
+
 }