| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 19999 | 陈路垚 | 评最优志愿者 | C++ | Accepted | 100 | 0 MS | 292 KB | 348 | 2021-05-27 21:22:17 |
#include<iostream> #include<cstdio> #include<algorithm> using namespace std; int main() { int n,i,j,k,ii,maxn=0; int a[105][105],b[105]={0}; cin>>n>>k; for (i=1;i<=k;i++){ for(j=1;j<=n;++j){ cin>>a[i][j]; b[j]+=a[i][j]; } } for(i=1;i<=n;++i) if(b[i]>maxn){ maxn=b[i];ii=i; } cout<<ii<<endl; return 0; }