백준 BOJ 15657 C++ [N과 M (8)]

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

int n, m, arr[9];
vector<int> vec;

void dfs(int level, int start) {
    if (level == m) {
        for (int i = 0; i < m; ++i) {
            cout << arr[i] << ' ';
        }
        cout << '\n';
        return;
    }
    for (int i = start; i < n; ++i) {
        arr[level] = vec[i];
        dfs(level + 1, i);
    }
}

void solve() {
    cin >> n >> m;
    for (int i = 0; i < n; ++i) {
        int num;
        cin >> num;
        vec.push_back(num);
    }
    sort(vec.begin(), vec.end());
    dfs(0, 0);
}

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