| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 81619 | 杨竣周 | cake | C++ | Wrong Answer | 0 | 50 MS | 652 KB | 314 | 2023-08-09 17:09:55 |
#include<bits/stdc++.h> using namespace std; bool cmp(int x,int y){ return x>y; } int n,a[100001],g,ans; int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; g+=a[i]; } g/=3; sort(a+1,a+n+1,cmp); for(int i=1;i<=n&&ans!=g;i++){ if(g-ans>=a[i]) ans+=a[i]; } cout<<ans; return 0; }