Submission #862338

#TimeUsernameProblemLanguageResultExecution timeMemory
862338maks007Olympiads (BOI19_olympiads)C++14
0 / 100
18 ms1488 KiB
#include "bits/stdc++.h" using namespace std; signed main () { int n, m, k; cin >> n >> m >> k; assert(m == 2); int a[n][m]; for(int i = 0; i < n; i ++) { for(int j = 0; j < m; j ++) { cin >> a[i][j]; } } vector <int> v; for(int i = 0; i < n; i ++) { for(int j = 0; j < n; j ++) { v.push_back(a[i][0] + a[j][1]); } } sort(v.rbegin(), v.rend()); assert(v.size() == n * n); cout << v[k-1]; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...