[Silver III] Title: N과 M (6), Time: 100 ms, Memory: 14180 KB -BaekjoonHub

Author: eastsage

백준/Silver/15655. N과 M （6）/N과 M （6）.java

@@ -1,49 +1,47 @@
 import java.io.BufferedReader;
 import java.io.IOException;
 import java.io.InputStreamReader;
-import java.util.ArrayList;
 import java.util.Arrays;
-import java.util.List;
 import java.util.StringTokenizer;
 
 public class Main {
-    static int n, m;
-    static int[] selected, arr;
-    static int[][] map, dp;
+    static int[] arr, selected;
     static boolean[] visited;
+    static int n, m;
     static StringBuilder sb = new StringBuilder();
-
     public static void main(String[] args) throws IOException {
         BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
         StringTokenizer st;
         st = new StringTokenizer(br.readLine());
         n = Integer.parseInt(st.nextToken());
         m = Integer.parseInt(st.nextToken());
-        visited = new boolean[n + 1];
-        selected = new int[m];
-        arr = new int[n];
+
         st = new StringTokenizer(br.readLine());
+        arr = new int[n];
         for (int i = 0; i < n; i++) {
             arr[i] = Integer.parseInt(st.nextToken());
         }
         Arrays.sort(arr);
+
+        selected = new int[m];
+        visited = new boolean[n + 1];
         recur(0, 0);
         System.out.println(sb);
     }
 
-    static void recur(int depth, int start) {
-        if (depth == m) {
+    static void recur(int cur, int start) {
+        if (cur == m) {
             for (int i : selected) {
                 sb.append(i).append(" ");
             }
             sb.append("\n");
             return;
         }
         for (int i = start; i < n; i++) {
-            if (visited[i]) continue;
+            if (visited[i] == true) continue;
             visited[i] = true;
-            selected[depth] = arr[i];
-            recur(depth + 1, i + 1);
+            selected[cur] = arr[i];
+            recur(cur + 1, i + 1);
             visited[i] = false;
         }
     }

백준/Silver/15655. N과 M （6）/README.md

@@ -4,15 +4,15 @@
 
 ### 성능 요약
 
-메모리: 14244 KB, 시간: 104 ms
+메모리: 14180 KB, 시간: 100 ms
 
 ### 분류
 
 백트래킹
 
 ### 제출 일자
 
-2024년 10월 22일 15:51:16
+2025년 1월 10일 13:51:50
 
 ### 문제 설명