| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 91443 | xiaoma_ustc | 评最优志愿者 | C++ | Accepted | 100 | 0 MS | 252 KB | 498 | 2024-03-21 19:28:00 |
#include <algorithm> #include <iostream> #include <string> using namespace std; int sum[105]; int main() { int a, b; cin >> a >> b; for (int i = 1; i <= b; i++) { for (int j = 1; j <= a; j++) { int x; cin >> x; sum[j] += x; } } int maxn = *max_element(sum + 1, sum + 1 + a); for (int i = 1; i <= a; i++) { if (sum[i] == maxn) {cout << i << endl;break;} } return 0; }