| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 148391 | 洛谷号:1021020 | 对抗赛 | C++ | Wrong Answer | 83 | 0 MS | 264 KB | 357 | 2024-05-23 21:48:55 |
#include <bits/stdc++.h> using namespace std; int num[101], f[10001]; int main() { int n, sum=0; cin >> n; for(int i = 1; i<=n; i++) { cin >> num[i]; sum+=num[i]; } sum/=2; for(int i = 1; i<=n; i++) { for(int j = sum; j>=num[i]; j--) { f[j]=max(f[j], f[j-num[i]]+num[i]); } } cout << f[sum] << endl; return 0; }