이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int const N=2005;
int const mod=1e9+7;
bool have[N][N];
void solve(){
int n;
cin>>n;
have[0][0]=1;
int sm=0;
for(int e=0;e<n;e++){
int c;
cin>>c;
sm+=c;
for(int i=500;i>=0;i--)
for(int j=500;j>=0;j--)
if(have[i][j]){
have[i+c][j]=1;
have[i][j+c]=1;
}
}
// cout<<sm<<endl;
for(int i=500;i>=0;i--)
if(have[i][i]){
cout<<sm-i<<endl;
return;
}
}
int main(){
int t=1;
// cin>>t;
while(t--)
solve();
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |