# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
525791 | ali22413836 | Olympiads (BOI19_olympiads) | C++14 | 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>
#define endl "\n"
using namespace std ;
typedef int ll;
typedef long double ld ;
ll mypower(ll x, ll y){
if(y == 0) return 1 ;
if(y == 1) return x ;
ll ret = mypower(x , y / 2);
ret = (ret * ret) % mod;
if(y % 2) ret = ( ret * x ) % mod ;
return ret ;
}
ll n , k , c ;
ll a[509][509] ;
set < pair < ll , vector < ll > > > ss;
bool can(ll ind , vector < ll > x){
for(auto p : x){
if (p == ind)
return 0 ;
}
return 1 ;
}
vector < ll > ans ;
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
scanf("%d%d%d", &n, &k, &c);
for(int i = 1 ; i <= n ; i++){
for(int j = 1 ; j <= k ; j++){
scanf("%d", &a[i][j]) ;
}
}
ss.insert({0 , {}}) ;
for(int i = 1 ; i <= k ; i++){
set < pair < ll , vector < ll > > > ss2 ;
for(auto p : ss){
for(int j = 1 ; j <= n ; j++){
if(can(j , p.second)){
vector < ll > nv = p.second ;
nv.push_back(j) ;
sort(nv.begin() , nv.end()) ;
ll nco = 0 ;
for(int l = 1 ; l <= nv.size() ; l++){
ll mx = 0 ;
for(auto q : nv){
mx = max(mx , a[q][l]) ;
}
nco += mx ;
}
ss2.insert({nco , nv}) ;
}
}
while(ss2.size() > c + 200){
ss2.erase(ss2.begin()) ;
}
}
ss = ss2 ;
}
for(auto p : ss)
ans.push_back(p.first);
printf("%d\n", ans[ans.size() - c]);
return 0 ;
}