[백준][C++] 15655 N과 M (6)

https://www.acmicpc.net/problem/15655

15655번: N과 M (6)

 

[백준][C++] 15655 N과 M (6)

#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;

void dfs(int n, int N, int M, vector<int> vec, vector<int> out, vector<int> visit) {
	if (out.size() == M) {
		for (int i : out) {
			cout << i << ' ';
		}
		cout << '\n';
		return;
	}

	for (int i = n; i < N; i++) {
		out.push_back(vec[i]);
		dfs(i + 1, N, M, vec, out, visit);
		out.pop_back();
	}
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	int N, M;
	cin >> N >> M;

	vector<int> vec(N, 0);
	for (int i = 0; i < N; i++) {
		cin >> vec[i];
	}
	sort(vec.begin(), vec.end());

	vector<int> out;
	vector<int> visit(N, 0);
	dfs(0, N, M, vec, out, visit);

	return 0;
}