View difference between Paste ID: iCXSGbc3 and v31w9RAq

 // Author : Saurav Kalsoor
-// Sort By Indices - JAVA
+// Sort By Indices - KOTLIN
 
-import java.util.*;
+import java.util.*
 
-public class Test {
+var sc: Scanner = Scanner(System.`in`)
 
-    static Scanner sc = new Scanner(System.in);
+fun main() {
-    public static void main(String[] args) {
+    val n: Int = sc.nextInt()
-        int n = sc.nextInt();
+    val m: Int = sc.nextInt()
-        int m = sc.nextInt();
+    val arr: ArrayList<Int> = ArrayList<Int>()
-        ArrayList<Integer> arr = new ArrayList<>();
+    val indices: ArrayList<Int> = ArrayList<Int>()
-        ArrayList<Integer> indices = new ArrayList<>();
+
     for (i in 0 until n) {
-        for(int i=0; i < n; i++) {
+        val input: Int = sc.nextInt()
-            int input = sc.nextInt();
+        arr.add(input)
-            arr.add(input);
+
     for (i in 0 until m) {
         val input: Int = sc.nextInt()
-        for(int i=0; i < m; i++) {
+        indices.add(input)
-            int input = sc.nextInt();
+
-            indices.add(input);
+    val result: ArrayList<Int> = sortByIndices(arr, indices, n, m)
 
     for (i in 0 until n)
-        ArrayList<Integer> result = sortByIndices(arr, indices, n, m);
+        print(result.get(i).toString() + " ")
-
+    println()
-        for(int i=0; i < n; i++)
+
-            System.out.print(result.get(i) + " ");
+
-
+fun sortByIndices(arr: ArrayList<Int>, indices: ArrayList<Int>, n: Int, m: Int): ArrayList<Int> {
-        System.out.println();
+    val sortDesc: ArrayList<Int> = ArrayList<Int>()
     val sortAsc: ArrayList<Int> = ArrayList<Int>()
     val indicesSet: HashSet<Int> = HashSet<Int>()
-    public static ArrayList<Integer> sortByIndices(ArrayList<Integer> arr, ArrayList<Integer> indices, int n, int m){
+
-        ArrayList<Integer> sortDesc = new ArrayList<Integer>();
+    for (i in 0 until m) {
-        ArrayList<Integer> sortAsc = new ArrayList<Integer>();
+        indicesSet.add(indices.get(i))
     }
-        HashSet<Integer> indicesSet = new HashSet<Integer>();
+
     for (i in 0 until n) {
-        for(int i=0; i < m; i++){
+        if (indicesSet.contains(i)) {
-            indicesSet.add(indices.get(i));
+            sortDesc.add(arr.get(i))
         } else {
             sortAsc.add(arr.get(i))
-        for(int i=0; i < n; i++){
+
-            if(indicesSet.contains(i)){
+
-                sortDesc.add(arr.get(i));
+
-            }else{
+    Collections.sort(sortDesc, Collections.reverseOrder())
-                sortAsc.add(arr.get(i));
+    Collections.sort(sortAsc)
-            }
+
     val result: ArrayList<Int> = ArrayList<Int>()
 
-        Collections.sort(sortDesc, Collections.reverseOrder());
+    var j = 0
-        Collections.sort(sortAsc);
+    var k = 0
 
-        ArrayList<Integer> result = new ArrayList<Integer>();
+    for (i in 0 until n) {
         if (indicesSet.contains(i)) {
-        int j = 0, k = 0;
+            result.add(sortDesc.get(j))
-        for(int i=0; i < n; i++){
+            j++
-            if(indicesSet.contains(i)){
+        } else {
-                result.add(sortDesc.get(j));
+            result.add(sortAsc.get(k))
-                j++;
+            k++
-            }else{
+
-                result.add(sortAsc.get(k));
+
-                k++;
+    return result
-            }
+}