Submission #863772

#TimeUsernameProblemLanguageResultExecution timeMemory
863772Trisanu_DasOlympiads (BOI19_olympiads)C++17
13 / 100
7 ms984 KiB
#include <bits/stdc++.h> using namespace std; int main () { int n, m, k; cin >> n >> m >> k; int a[n][m]; for(int i = 0; i < n; i++) for(int j = 0; j < m; j++) cin >> a[i][j]; vector<int> b; for(int i = 0; i < n; i++) for(int j = i + 1; j < n; j++) b.push_back(max(a[i][0], a[j][0]) + max(a[i][1], a[j][1])); sort(b.rbegin(), b.rend()); cout << b[k - 1]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...