Submission #863771

#TimeUsernameProblemLanguageResultExecution timeMemory
863771Trisanu_DasOlympiads (BOI19_olympiads)C++17
0 / 100
8 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[i][1]) + max(a[i][1], a[j][1])); sort(b.rbegin(), b.rend()); cout << b[k - 1] << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...