알고리즘 풀이/백준

15656번-n과 m(7)

claire 2022. 3. 9. 11:40
#include<iostream>
#include<algorithm>
using namespace std;

int n, m;
int board[10];
int arr[10];
bool isused[10];

void func(int k) {
	if (k == m) {
		for (int i = 0; i < m; i++) {
			cout << board[arr[i]] << ' ';
		}
		cout << '\n';
		return;
	}
	for (int i = 0; i < n; i++) {
		arr[k] = i;
		
		func(k + 1);
		
	}
}

int main() {
	cin >> n >> m;
	for (int i = 0; i < n; i++)
		cin >> board[i];
	sort(board, board + n);
	func(0);
}