N과 M (11) - 15665

문제 : 

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

15665번: N과 M (11)

 

코드 : 

#include <iostream>
#include <algorithm>

using namespace std;

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

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

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

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

	sort(temp, &temp[n]);

	//중복제거
	int count = 0;
	for (int i = 0; i < n; i++)
	{
		if (i - 1 >= 0 && value[count - 1] == temp[i])
		{
			continue;
		}
		value[count++] = temp[i];
	}

	solution(0, count, m);
	return 0;
}