View difference between Paste ID: v31w9RAq and YxWZDY91

 // Author : Saurav Kalsoor
-// Sort By Digit Sum - JAVA
+// Sort By Indices - 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 m = sc.nextInt();
         ArrayList<Integer> arr = new ArrayList<>();
         ArrayList<Integer> indices = new ArrayList<>();
 
         for(int i=0; i < n; i++) {
             int input = sc.nextInt();
             arr.add(input);
-        ArrayList<Integer> result = sortByDigits(arr);
+
 
         for(int i=0; i < m; i++) {
             int input = sc.nextInt();
             indices.add(input);
         }
 
         ArrayList<Integer> result = sortByIndices(arr, indices, n, m);
-    public static ArrayList<Integer> sortByDigits(ArrayList<Integer> arr){
+
-        Collections.sort(arr, new SortBySumOfDigits());
+
-        return arr;
+
 
         System.out.println();
     }
-class SortBySumOfDigits implements Comparator<Integer> {
+
-
+    public static ArrayList<Integer> sortByIndices(ArrayList<Integer> arr, ArrayList<Integer> indices, int n, int m){
-    public int compare(Integer a, Integer b){
+        ArrayList<Integer> sortDesc = new ArrayList<Integer>();
         ArrayList<Integer> sortAsc = new ArrayList<Integer>();
-        int sumA = getSum(a), sumB = getSum(b);
+
-        if(sumA == sumB){
+        HashSet<Integer> indicesSet = new HashSet<Integer>();
-            return a - b;
+
         for(int i=0; i < m; i++){
-        else{
+            indicesSet.add(indices.get(i));
-            return sumA - sumB;
+
 
         for(int i=0; i < n; i++){
             if(indicesSet.contains(i)){
-    public int getSum(int n){
+                sortDesc.add(arr.get(i));
-        int sum = 0;
+            }else{
-        while(n > 0){
+                sortAsc.add(arr.get(i));
-            sum = sum + n%10;
+            }
-            n = n/10;
+
 
-        return sum;
+        Collections.sort(sortDesc, Collections.reverseOrder());
         Collections.sort(sortAsc);
 
         ArrayList<Integer> result = new ArrayList<Integer>();
 
         int j = 0, k = 0;
         for(int i=0; i < n; i++){
             if(indicesSet.contains(i)){
                 result.add(sortDesc.get(j));
                 j++;
             }else{
                 result.add(sortAsc.get(k));
                 k++;
             }
         }
 
         return result;
     }
 }