/* Author : Mychecksdead */
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " is " << x << '\n';
const int N = 1e6+100, M = 305, F = 2147483646, K = 20;
int n, k, c, a[600][7];
void solve(){
cin >> n >> k >> c;
for(int i = 1; i <= n; ++i) for(int j = 0; j < 6; ++j) a[i][j] = 0;
for(int i = 1; i <= n; ++i){
for(int j = 0; j < k; ++j) cin >> a[i][j];
}
if(k <= 2){
vector<int> v;
for(int i = 1; i <= n; ++i){
for(int j = i + 1; j <= n; ++j){
int x = 0, y = 0;
x = max(a[i][0], a[j][0]);
y = max(a[i][1], a[j][1]);
v.pb(x + y);
}
}
sort(all(v), greater<int>());
cout << v[c - 1];
}else if(n <= 40){
vector<int> v;
if(k == 1){
for(int h = 1; h <= n; ++h){
int sum = 0;
for(int x = 0; x < k; ++x){
sum += a[h][x];
}
v.pb(sum);
}
}else if(k == 2){
for(int p = 1; p <= n; ++p){
for(int h = p + 1; h <= n; ++h){
int sum = 0;
for(int x = 0; x < k; ++x){
sum += max({a[p][x], a[h][x]});
}
v.pb(sum);
}
}
}else if(k == 3){
for(int o = 1; o <= n; ++o){
for(int p = o + 1; p <= n; ++p){
for(int h = p + 1; h <= n; ++h){
int sum = 0;
for(int x = 0; x < k; ++x){
sum += max({a[o][x], a[p][x], a[h][x]});
}
v.pb(sum);
}
}
}
}else if(k == 4){
for(int l = 1; l <= n; ++l){
for(int o = l + 1; o <= n; ++o){
for(int p = o + 1; p <= n; ++p){
for(int h = p + 1; h <= n; ++h){
int sum = 0;
for(int x = 0; x < k; ++x){
sum += max({a[l][x], a[o][x], a[p][x], a[h][x]});
}
v.pb(sum);
}
}
}
}
}else if(k == 5){
for(int j = 1; j <= n; ++j){
for(int l = j + 1; l <= n; ++l){
for(int o = l + 1; o <= n; ++o){
for(int p = o + 1; p <= n; ++p){
for(int h = p + 1; h <= n; ++h){
cout << j << ' ' << l << ' ' << o << ' ' << p << ' ' << h << '\n';
int sum = 0;
for(int x = 0; x < k; ++x){
sum += max({a[j][x], a[l][x], a[o][x], a[p][x], a[h][x]});
}
v.pb(sum);
}
}
}
}
}
}else{
for(int i = 1; i <= n; ++i){
for(int j = i + 1; j <= n; ++j){
for(int l = j + 1; l <= n; ++l){
for(int o = l + 1; o <= n; ++o){
for(int p = o + 1; p <= n; ++p){
for(int h = p + 1; h <= n; ++h){
int sum = 0;
for(int x = 0; x < k; ++x){
sum += max({a[i][x], a[j][x], a[l][x], a[o][x], a[p][x], a[h][x]});
}
v.pb(sum);
}
}
}
}
}
}
}
sort(all(v), greater<int>());
cout << v[c - 1];
}else{
int ans = 0;
for(int i = 1; i <= 10; ++i){
for(int j = 1; j <= 10; ++j)
for(int l = 1; l <= 10; ++l)
for(int h = 1; h <= 10; ++h)
for(int f = 1; f <= 10; ++f)
for(int b = 1; b <= 10; ++b){
vector<int> mx(6);
for(int el = 1; el <= n; ++el){
if(a[el][0] <= i && a[el][1] <= l && a[el][2] <= h && a[el][3] <= f && a[el][4] <= h && a[el][5] <= b){
for(int y = 0; y < 6; ++y) mx[i] = max(mx[i], a[el][y]);
}
}
bool ok =
(mx[0] == i) &
(k < 2 || mx[1] == j) &
(k < 3 || mx[2] == l) &
(k < 4 || mx[3] == h) &
(k < 5 || mx[4] == f) &
(k < 6 || mx[5] == b);
if(ans >= c){
cout << i + j + l + h + f + b;
return;
}
}
}
}
}
int main(){
cin.tie(0); ios::sync_with_stdio(0);
int T = 1, aa;
// cin >> T;aa=T;
while(T--){
// cout << "Case #" << aa-T << ": ";
solve();
cout << '\n';
}
return 0;
}
Compilation message
olympiads.cpp: In function 'void solve()':
olympiads.cpp:134:38: warning: unused variable 'ok' [-Wunused-variable]
134 | bool ok =
| ^~
olympiads.cpp: In function 'int main()':
olympiads.cpp:156:16: warning: unused variable 'aa' [-Wunused-variable]
156 | int T = 1, aa;
| ^~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
8 ms |
968 KB |
Output is correct |
| 2 |
Correct |
7 ms |
984 KB |
Output is correct |
| 3 |
Correct |
5 ms |
968 KB |
Output is correct |
| 4 |
Correct |
3 ms |
968 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
365 ms |
16904 KB |
Output is correct |
| 2 |
Correct |
350 ms |
16828 KB |
Output is correct |
| 3 |
Correct |
388 ms |
16812 KB |
Output is correct |
| 4 |
Correct |
357 ms |
16812 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1632 ms |
340 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
8 ms |
968 KB |
Output is correct |
| 2 |
Correct |
7 ms |
984 KB |
Output is correct |
| 3 |
Correct |
5 ms |
968 KB |
Output is correct |
| 4 |
Correct |
3 ms |
968 KB |
Output is correct |
| 5 |
Correct |
365 ms |
16904 KB |
Output is correct |
| 6 |
Correct |
350 ms |
16828 KB |
Output is correct |
| 7 |
Correct |
388 ms |
16812 KB |
Output is correct |
| 8 |
Correct |
357 ms |
16812 KB |
Output is correct |
| 9 |
Incorrect |
1632 ms |
340 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
