인프런 커뮤니티 질문&답변

#include<iostream>
#include<vector>
#include<math.h>
#include<string>
#include<deque>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;

int N;
vector<pair<int, int>> vec;
vector<int> check(N+1, 0);
int m = 2147000000;

void DFS(int k, int cnt)
{
    if(cnt == N/2)
    {
        int sum1 = 0;
        int sum2 = 0;
        for(int i = 1; i <= N; i++)
        {
            if(check[i] == 1)
            {
                sum1 += vec[i].first;
            }
            else
            {
                sum2 += vec[i].second;
            }
        }
        m = min(abs(sum1-sum2) , m);

    }

    else
    {
    for(int i = k; i <= N; i++)
    {
        if(check[i] == 0)
        {
           check[i] = 1;
           DFS(i + 1, cnt + 1);
           check[i] = 0;
        }
    }
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
  
    cin >> N;
    vec.push_back({0,0});
    for(int i = 0; i < N; i++)
    {
        int a, b;
        cin >> a >> b;
        vec.push_back({a, b});
    }

   
    DFS(1, 0);


    cout << m;
    return 0;
}