# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
863769 | Trisanu_Das | Olympiads (BOI19_olympiads) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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(v.rbegin(), v.rend());
cout << v[k - 1] << '\n';
}