[BOJ] 15656 : N과 M (7)

#include <bits/stdc++.h>
using namespace std;
 
int n, m;
int arr[8];
int ans[8];
void solve(int depth) {
    if (depth == m) {
        for (int i = 0; i < m; i++) cout << ans[i] << ' ';
        cout << '\n';
        return;
    }
    for (int i = 0; i < n; i++) {
        ans[depth] = arr[i];
        solve(depth + 1);
        
    }
}
 
int main(void) {
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cin >> n >> m;
    for (int i = 0; i < n; i++) cin >> arr[i];
    sort(arr, arr + n);
    solve(0);
}