View difference between Paste ID: SzhD5Jx1 and LDTapVBL

 // Author : Saurav Kalsoor
-// Minimize Unique Numbers - JAVA
+// Robot - 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 x = sc.nextInt();
         int y = sc.nextInt();
 
         ArrayList<Integer> arr = new ArrayList<>();
 		for(int i = 0;i < n; i++){
 			arr.add(sc.nextInt());
 		}
-		System.out.println(minimizeUnique(arr, k));
+		robot(arr, x, y);
     }
 
-    public static int minimizeUnique(ArrayList<Integer> arr, int k){
+    public static void robot(ArrayList<Integer> moves, int x, int y) {
-		HashMap<Integer, Integer> count = new HashMap<>();
+        HashSet<String> set = new HashSet<>();
         set.add("0 0");
-		for(int num : arr){
+
-			count.put(num, count.getOrDefault(num, 0) + 1);
+        int x_dir = 0, y_dir = 0, x_val = 0, y_val = 0;
         for(int i = 0;i < moves.size(); i++){
             switch(moves.get(i)){
-		Set<MyPair> st = new TreeSet<>(new Comparator<MyPair>() {
+                case 0:
-			@Override
+                    x_dir = 0;
-			public int compare(MyPair a, MyPair b) {
+                    y_dir = 1;
-				if(a.second == b.second)
+                    break;
-					return a.first - b.first;
+                case 2:
-				return a.second - b.second;
+                    x_dir = 0;
-			}
+                    y_dir = -1;
-		});
+                    break;
                 case 1:
-		for(Map.Entry<Integer, Integer> x : count.entrySet()){
+                    x_dir = 1;
-			st.add(new MyPair(x.getKey(), x.getValue()) );
+                    y_dir = 0;
-		}
+                    break;
                 case 3:
-		int res = st.size();
+                    x_dir = -1;
                     y_dir = 0;
-		for(MyPair x : st){
+                    break;
-			if(k >= x.second){
+            }
-				res--;
+            x_val += x_dir;
-				k -= x.second;
+            y_val += y_dir;
-			}else{
+            if(set.contains(x_val + " " + y_val)){
-				break;
+                i--;
-			}
+            }else{
                 set.add(x_val + " " + y_val);
             }
-		return res;
+        }
 
         System.out.println((x_val + x) + " " + (y_val + y));
     }
 
-class MyPair{
+
-	public int first, second;
+
 
-	public MyPair(int first, int second){
+