백준 N과 M(5) C++

 

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

15654번: N과 M (5)

 

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

int n, m;
vector<int>arr;
vector<int>v;
vector<bool>visited;

void permutation(int idx) {
	if (idx == m) {
		for (int i = 0; i < m; i++) {
			cout << v[i] << ' ';
		}
		cout << '\n';
		return;
	}

	for (int i = 0; i < n; i++) {
		if (visited[i])continue;
		v[idx] = arr[i]; 
		visited[i] = true;
		permutation(idx + 1);
		visited[i] = false;
	}

}



int main() {

	cin >> n >> m;

	arr.assign(n, 0);
	visited.assign(n, false);
	v.assign(m, 0);
	for (int i = 0; i < n; i++) {
		cin >> arr[i];
	}
	sort(arr.begin(), arr.end());
	
	permutation(0);
	



}