(C++) - 백준(BOJ) 15665번 : N과 M (11)

https://www.acmicpc.net/problem/15665

15665번: N과 M (11)

 

#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
int n, m;
int a[8];
int ck[8];
int tmp[8];
set<vector<int>> ans;
//중복 저장을 하지 않는 set이용
void DFS(int level)
{
    if (level == m)
    {
        vector<int> v;
        for (int i = 0; i < m; i++)
            v.push_back(tmp[i]);
        //set에 무조건 때려박는다
        ans.insert(v);
        v.clear();
        return;
    }
    for (int i = 0; i < n; i++)
    {    
        
            tmp[level] = a[i];
            DFS(level + 1);
        
    }
}
int main() {
    cin >> n >> m;
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    sort(a, a + n);//정렬
    DFS(0);
 
    for (auto a : ans)
    {
        for (int i = 0; i < a.size(); i++)
        {
            cout << a[i] << ' ';
        }
        cout << '\n';
    }
}