백준 BOJ 15644 C++ [N과 M (5)]

#include <bits/stdc++.h>
using namespace std;

int n, m, arr[9], ans[9];
bool visited[9];

void dfs(int level) {
    if (level > m) {
        for (int i = 1; i <= m; ++i) {
            cout << ans[i] << ' ';
        }
        cout << '\n';
        return;
    }
    for (int i = 1; i <= n; ++i) {
        if (!visited[i]) {
            visited[i] = true;
            ans[level] = arr[i];
            dfs(level + 1);
            visited[i] = false;
        }
    }
}

void solve() {
    cin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        cin >> arr[i];
    }
    sort(arr + 1, arr + 1 + n);
    dfs(1);
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    solve();
    return 0;
}