3 solutions
-
0
#include<bits/stdc++.h> using namespace std; const int N=10010; int a[N],b[N]; int main() { int n,m; cin>>n>>m; for(int i=1;i<=n;i++) { cin>>a[i]; } for(int i=1;i<=n;i++) { int minv=1e8; int minw=0; for(int j=1;j<=m;j++) { if(b[j]<minv) { minv=b[j]; minw=j; } } b[minw]+=a[i]; } int maxu=0; for(int i=1;i<=m;i++) { if(b[i]>maxu) { maxu=b[i]; } } cout<<maxu; return 0; }
Information
- ID
- 430
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- 9
- Tags
- # Submissions
- 10
- Accepted
- 6
- Uploaded By