[C++] 백준 2309번 : 일곱 난쟁이

#include <bits/stdc++.h>
using namespace std;


vector<int> man;
int sum;
int arr[2] = { 0, };
bool find_man;

int main(void) {
	ios::sync_with_stdio(0);
	cin.tie(0);

	int height;
	for (int i = 0; i < 9; i++)
	{
		cin >> height;
		man.push_back(height);
		sum += height;
	}

	sort(man.begin(), man.end());
	int temp_sum = sum;

	for (int i = 0; i < 9; i++)
	{
		for (int j = i+1; j < 9; j++)
		{
			if (i != j)
			{
				temp_sum = sum;
				temp_sum -= man[i];
				temp_sum -= man[j];
				if (temp_sum == 100) 
				{
					arr[0] = man[i];
					arr[1] = man[j];
					find_man = true;
					break;
				}
			}
		}
		if (find_man) break;
	}

	for (int i = 0; i < 9; i++)
	{
		if (man[i] != arr[0] && man[i] != arr[1])
		{
			cout << man[i] << '\n';
		}
	}
}