Submission #863775

#TimeUsernameProblemLanguageResultExecution timeMemory
863775Trisanu_DasOlympiads (BOI19_olympiads)C++17
0 / 100
2015 ms132296 KiB
#include <bits/stdc++.h> using namespace std; int n, m, k, a[505][10]; vector<int> b; int qry(vector<int> val){ int x[10]; memset(x, 0, sizeof(x)); for(int xx : x) for(int j = 0; j < m; j++) x[j] = max(x[j], a[xx][j]); int ans = 0; for(int j = 0; j < m; j++) ans += x[j]; return ans; } void make(int idx, vector<int> val){ if(idx == m){ b.push_back(qry(val)); return; } for(int j = val.back() + 1; j < n; j++){ val.push_back(j); make(idx + 1, val); val.pop_back(); } } int main () { cin >> n >> m >> k; for(int i = 0; i < n; i++) for(int j = 0; j < m; j++) cin >> a[i][j]; for(int i = 0; i < n; i++) make(1, {i}); sort(b.rbegin(), b.rend()); cout << b[k - 1] << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...