[BOJ]15656 N과 M (7)

• sol : 백트래킹 재귀 DFS
• 입력 배열(input)을 활용해 값 할당

#include <bits/stdc++.h>
using namespace std;
int N, M;
vector<int> input;
vector<int> vec(9);
void DFS(int depth){
    if(depth == M){
        for(int i = 0; i < M; ++i){
            cout << vec[i] << ' ';
        }
        cout << '\n';
        return;
    }
    for(int i = 0; i < N; ++i){
        vec[depth] = input[i];
        DFS(depth+1);
    }
}
int main(){
    cin >> N >> M;
    for(int i = 0; i < N; ++i){
        int tmp;
        cin >> tmp;
        input.push_back(tmp);
    }
    sort(input.begin(), input.end());
    DFS(0);
    return 0;
}