Submission #530115

#TimeUsernameProblemLanguageResultExecution timeMemory
530115fatemetmhrOlympiads (BOI19_olympiads)C++17
13 / 100
8 ms1488 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define pb push_back #define fi first #define se second #define all(x) x.begin(), x.end() const int maxn5 = 7e3 + 10; int a[maxn5][2]; vector <ll> av; int main(){ ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, k, c; cin >> n >> k >> c; for(int i = 0; i < n; i++){ for(int j = 0; j < k; j++) cin >> a[i][j]; } if(k == 1){ for(int i = 0; i < n; i++) av.pb(a[i][0]); sort(all(av)); reverse(all(av)); cout << av[c - 1] << endl; return 0; } for(int i = 0; i < n; i++) for(int j = i + 1; j < n; j++){ av.pb(max(a[i][0], a[j][0]) + max(a[i][1], a[j][1])); } sort(all(av)); reverse(all(av)); cout << av[c - 1] << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...