| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 14892 | 汤依宁 | 排队打水问题 | C++ | Wrong Answer | 0 | 1 MS | 264 KB | 329 | 2025-11-24 06:54:36 |
#include <bits/stdc++.h> using namespace std; int n,r,a[10000],b[1000],m=0; long long s=0; int main() { cin>>n>>r; for (int i=0; i<n; i++) { cin>>a[i]; } sort(a,a+n); for (int i=0; i<n; i++) { for (int j=1; j<r; j++) if (b[j]<b[m]) { m=j; } s+=b[m]+a[i]; b[m]+=a[i]; } cout<<s<<endl; }