N과 M (8) - 15657

문제 :

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

15657번: N과 M (8)

 

코드 : 

#include <iostream>
#include <algorithm>

using namespace std;

int num[10];
int num[10];

void solution(int start, int index, int n, int m)
{
	//탈출조건
	if (index == m)
	{
		for (int i = 0; i < m; i++)
		{
			cout << num[i] << " ";
		}
		cout << "\n";
		return;
	}

	for (int i = start; i < n; i++)
	{
		num[index] = num[i];
		solution(i, index + 1, n, m);
	}
}

int main()
{
	int n, m;
	cin >> n >> m;

	for (int i = 0; i < n; i++)
	{
		cin >> num[i];
	}

	sort(num, &num[n]);

	solution(0, 0, n, m);

	return 0;
}