일곱난쟁이

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

int main() {
	int d[10];
	for (int i = 1; i <= 9; i++)
	{
		cin >> d[i];
	}
	vector<int> s = { 1,2,3,4,5,6,7,8,9 };
	vector<int> result;
	do {
		int sum = 0;
		for (int i = 0; i < 7; i++) {
			sum += d[s[i]];
		}
		if (sum == 100)
		{
			for (int i = 0; i < 7; i++) {
				result.push_back(d[s[i]]);
			}
			break;
		}
	} while (next_permutation(s.begin(), s.end()));
	sort(result.begin(), result.end());

	for (int i = 0; i < 7; i++)
		cout << result[i] << endl;
	return 0;


}

bruteforc