[백준] 2309번 일곱 난쟁이

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

2309번: 일곱 난쟁이

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

int arr[9];
int flag = false;

void combination(int num, vector<int> result, vector<bool> visited) {
	if (flag) return;
	if (num == 7) {
		int total = 0;
		for (int i = 0; i < 7; i++) {
			total += result[i];
		}
		if (total == 100) {
			flag = true;
			for (int i = 0; i < 7; i++) {
				cout << result[i] << endl;
			}
		}
		return;
	}
	for (int i = 0; i < 9; i++) {
		if (num == 0) {
			if (!visited[i]) {
				visited[i] = true;
				result[num] = arr[i];
				combination(num + 1, result, visited);
				visited[i] = false;
			}
		}
		else {
			if (arr[i] > result[num - 1]) {
				if (!visited[i]) {
					visited[i] = true;
					result[num] = arr[i];
					combination(num + 1, result, visited);
					visited[i] = false;
				}
			}
		}
	}
}

int main() {
	for (int i = 0; i < 9; i++) {
		cin >> arr[i];
	}
	sort(arr, arr + 9);
	vector<int> result(7);
	vector<bool> visited(9);
	combination(0, result, visited);
	return 0;
}