kingsubin

import java.io.*;
import java.util.*;
 
public class boj_15665 {
    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
    static StringTokenizer st;
    static boolean[] v = new boolean[10];
    static int[] a = new int[10];
    static int[] val;
    static int n, m;
 
    public static void main(String[] args) throws IOException {
        st = new StringTokenizer(br.readLine());
        n = Integer.parseInt(st.nextToken());
        m = Integer.parseInt(st.nextToken());
        val = new int[n];
 
        st = new StringTokenizer(br.readLine());
        for (int i = 0; i < n; i++) {
            val[i] = Integer.parseInt(st.nextToken());
        }
 
        Arrays.sort(val);
 
        func(0);
        bw.flush();
        bw.close();
    }
 
    static void func(int k) throws IOException {
        if (k == m) {
            for (int i = 0; i < m; i++) {
                bw.append(a[i] + " ");
            }
            bw.newLine();
            return;
        }
 
        int before = 0;
        for (int i = 0; i < n; i++) {
            if (before == val[i]) continue;
 
            a[k] = val[i];
            before = a[k];
 
            func(k + 1);
        }
    }
}
 

 

- 백트래킹

- 이제 N과 M 시리즈는 다 풀 수 있을거 같다

 

- 중복제거, 같은수 써도 됨 

 

 

 

 

---

www.acmicpc.net/problem/15665