View difference between Paste ID: ACT040rD and Et4BNJgc

 //Author - Saurav Kalsoor
-// Finding Kth Smallest - JAVA
+// Finding Kth Smallest - KOTLIN
 
-import java.util.Vector;
+import java.util.*
-import java.util.*;
+import java.lang.*
 
-public class Test {
+var sc: Scanner = Scanner(System.`in`)
-
+
-    static Scanner sc = new Scanner(System.in);
+fun main() {
-
+    val n: Int = sc.nextInt()
-    public static void swap(char ch[],int i,int j) {
+    val k: Int = sc.nextInt()
-    	char temp = ch[i];
+    val s: String = sc.next()
-    	ch[i] = ch[j];
+    println(findingKthSmallest(n, k, s))
-    	ch[j] = temp;
+}
 
-
+fun swap(ch: CharArray, i: Int, j: Int) {
-    public static void findingAllRearrangements(char ch[],int n,Vector<String> v,int itr){
+    val temp = ch[i]
-        if(itr==n-1){
+    ch[i] = ch[j]
-        	String s = "";
+    ch[j] = temp
-        	for(char i : ch) {
+}
-        		s+=i;
+
-        	}
+fun findingAllRearrangements(ch: CharArray, n: Int, v: Vector<String>, itr: Int) {
-        	v.add(s);
+    if (itr == n - 1) {
-            return;
+        var s: String = ""
         for (i in ch) {
-        HashSet<Character> hs = new HashSet<Character>();
+            s += i
-        for(int i=itr;i<n;i++) {
+
-        	if(!hs.contains(ch[i])) {
+        v.add(s)
-        		hs.add(ch[i]);
+        return
-        		swap(ch,itr,i);
+
-        		findingAllRearrangements(ch,n,v,itr+1);
+    val hs: HashSet<Char> = HashSet<Char>()
-        		swap(ch,itr,i);
+    for (i in itr until n) {
-        	}
+        if (!hs.contains(ch[i])) {
             hs.add(ch[i])
             swap(ch, itr, i)
-
+            findingAllRearrangements(ch, n, v, itr + 1)
-    public static String findingKthSmallest(int n, int k, String s){
+            swap(ch, itr, i)
-        char ch[] = s.toCharArray();
+
-        Vector<String> v = new Vector<String>();
+
-        findingAllRearrangements(ch,n,v,0);
+}
-        Collections.sort(v);
+
-        if(k<=v.size()) {
+fun findingKthSmallest(n: Int, k: Int, s: String): String {
-        	return v.get(k-1);
+    val ch: CharArray = s.toCharArray()
     val v: Vector<String> = Vector<String>()
-        return "-1";
+    findingAllRearrangements(ch, n, v, 0)
     Collections.sort(v)
-
+    return if (k <= v.size) {
-    public static void main(String[] args) {
+        v.get(k - 1)
-        int n = sc.nextInt();
+    } else "-1"
-        int k = sc.nextInt();
+}
-        String s = sc.next();
+