View difference between Paste ID: 0FWfSxUB and YGst2Hmc

 // Author : Saurav Kalsoor
-// Sort By Primes - JAVA
+// Game with Thor and Loki - JAVA
 
 import java.util.*;
 
 public class Test {
 
     static Scanner sc = new Scanner(System.in);
     public static void main(String[] args) {
         int n = sc.nextInt();
 
         ArrayList<Integer> arr = new ArrayList<>();
 
         for(int i=0; i < n; i++) {
             int input = sc.nextInt();
             arr.add(input);
         }
 
-        ArrayList<Integer> result = sortPrimeNonPrime(arr, n);
+		gameWithThorAndLoki(arr, n);
-
+
-        for(int i=0; i < n; i++)
+
-            System.out.print(result.get(i) + " ");
+
-
+    public static void gameWithThorAndLoki(ArrayList<Integer> arr, int n){
-        System.out.println();
+		int start = 0, end = n - 1;
 		boolean isThorsTurn = true;
 
-    public static ArrayList<Integer> sortPrimeNonPrime(ArrayList<Integer> arr, int n){
+		ArrayList<Integer> res = recurr(arr, start, end, isThorsTurn);
 
-        int maxLimit = 10001;
+		System.out.println(res.get(0) + " " + res.get(1));
-        HashSet<Integer> primesSet = new HashSet<>();
+
-        boolean[] isPrime = new boolean[maxLimit];
+
 	public static ArrayList<Integer> recurr(ArrayList<Integer> arr, int start, int end, boolean isThorsTurn){
-        for(int i=2; i < maxLimit; i++) isPrime[i] = true;
+		if(start > end){
 			ArrayList<Integer> res = new ArrayList<Integer>();
-        for(int i=2; i < maxLimit; i++){
+			res.add(0);
-            if(isPrime[i]){
+			res.add(0);
-                primesSet.add(i);
+			return res;
-                for(int j = i*i ; j < maxLimit; j += i)
+		}
-                    isPrime[j] = false;
+
-            }
+		int left = arr.get(start);
 		int right = arr.get(end);
 		int currThor = 0, currLoki = 0;
-        ArrayList<Integer> primes = new ArrayList<Integer>();
+
-        ArrayList<Integer> nonPrimes = new ArrayList<Integer>();
+		if(isThorsTurn){
 			currThor = Math.max(left, right);
-        for(int i=0; i < n; i++){
+			currLoki = Math.min(left, right);
-            if(primesSet.contains(arr.get(i))){
+		}else{
-                primes.add(arr.get(i));
+			currLoki = Math.max(left, right);
-            }else{
+			currThor = Math.min(left, right);
-                nonPrimes.add(arr.get(i));
+		}
-            }
+
 		start++;
 		end--;
-        Collections.sort(primes);
+		ArrayList<Integer> res = recurr(arr, start, end, !isThorsTurn);
-        Collections.sort(nonPrimes, Collections.reverseOrder());
+
-
+		res.set(0, res.get(0) + currThor);
-        ArrayList<Integer> result = new ArrayList<Integer>();
+		res.set(1, res.get(1) + currLoki);
 		return res;
-        int j = 0, k = 0;
+	}
-        for(int i=0; i < n; i++){
+
-            if(primesSet.contains(arr.get(i))){
+
-                result.add(primes.get(j));
+
-                j++;
+
-            }else{
+
-                result.add(nonPrimes.get(k));
+