제출 #1159693

#제출 시각아이디문제언어결과실행 시간메모리
1159693mnbvcxz123Kas (COCI17_kas)C++20
30 / 100
32 ms1168 KiB
#include<bits/stdc++.h>
using namespace std;

const int MAXN = 505;
const int MAXS = 100010; 
const int INF  = 1e9;

int n, sum, sol;
int c[MAXN];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    bitset<2000005>bs;
    bs[0]=1;
    cin>>n;
  for (int i = 0; i < n; ++i) {
    cin>>c[i];
    bs|=(bs<<c[i]);
    sum+=c[i];
    }

    for(int i=sum/2;i>=0;--i)
        if(bs[i] and bs[i<<1]){
            cout<<i+sum-2*i<<'\n';
            break;
        }

  return 0;

}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...