| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1366975 | uranhishig | IMO (EGOI25_imo) | C++20 | 0 ms | 344 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
signed main(){
int n, m, k;
cin >> n >> m >> k;
int a[n][m];
vector<int> sum(n, 0);
for (int i=0; i <n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
sum[i] += a[i][j];
}
}
if(n == 2) {
vector<int> v;
int cur = m * k;
int x = 0;
if (sum[0] >= sum[1]) {
for (int i =0; i < m; i++) v.pb(a[0][i]);
for (int i =0; i < m; i++) v.pb(k - a[1][i]);
}
else {
for (int i =0; i < m; i++) v.pb(a[1][i]);
for (int i =0; i < m; i++) v.pb(k - a[0][i]);
}
sort(v.rbegin(), v.rend());
while (x < 2*m and cur >0) {
cur -= v[x];
x++;
}
cout << n * m - x;
}
return 0;
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
