(C++) - 백준(BOJ) 15655번 : N과 M (6)

#include <iostream>
#include <algorithm>
using namespace std;
int n, m;
int a[8];
int ans[8];
int ck[8];
void DFS(int level,int node)
{
    if (level == m)
    {
        for (int i = 0; i < m; i++)
        {
            cout << ans[i] << ' ';
        }
        cout << '\n';
        return;
    }
    for (int i = node; i < n; i++)
    {    
        if (ck[i] == 0)
        {
            ck[i] = 1;
            ans[level] = a[i];
            DFS(level + 1,i+1);
            ck[i] = 0;
        }
    }
}
 
int main() {
    cin >> n >> m;
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    sort(a, a + n);
    DFS(0,0);
}