[백준알고리즘] 2309번 일곱난쟁이

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

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
 
vector<int> v;
int answer[7];
int flag = 0;
 
int cal(void)
{
    int sum = 0;
    for (int i = 0; i < 7; i++)
    {
        sum += answer[i];
    }
 
    if (sum == 100) return 1;
    return 0;
}
void find_seven(int idx, int pos)
{
    if (pos == 7)
    {
        flag = cal();
        return;
    }
    for (int i = idx; i < 9; i++)
    {
        answer[pos] = v[i];
        find_seven(i + 1, pos + 1);
 
        if (flag) return;
    }
    return;
}
 
int main(void)
{
    int data = 0;
 
    for (int i = 0; i < 9; i++) {
        cin >> data;
        v.push_back(data);
    }
 
    sort(v.begin(), v.end());
 
    find_seven(0,0);
 
    for (int i = 0; i < 7; i++)
        cout << answer[i] << '\n';
 
    return 0;
}