[BOJ] N과M(6)_15655.cpp

//15655_N과M(6).cpp - success
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
bool check[10];
int num[10];
void solve(vector <int>& buf, int idx, int start, int n, int m) {
	if (idx == m) {
		for (int i = 0; i < m; i++) {
			cout << num[i];
			if (i != (m - 1)) cout << ' ';
		}
		cout << '\n';
		return;
	}
	for (int i = start; i < n; i++) {
		if (check[i]) continue;
		check[i] = true;
		num[idx] = buf[i];
		solve(buf, idx + 1, i, n, m);
		check[i] = false;
	}
}

int main() {
	int n, m;
	cin >> n >> m;
	vector <int> buf(n);
	for (int i = 0; i < n; i++) {
		cin >> buf[i];
	}
	sort(buf.begin(), buf.end());
	solve(buf, 0, 0, n, m);
	return 0;
}