# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
862389 | iskhakkutbilim | Olympiads (BOI19_olympiads) | C++17 | 20 ms | 2520 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;
#define int long long
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
const int SCORE = 100;
int n, k, c;
int a[501][7];
//int dp[501][7][6*SCORE + 5];
main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n >> k >> c;
for(int i = 1;i <= n; i++){
for(int j = 1;j <= k; j++){
cin >> a[i][j];
}
}
vector<int> sc;
if(k ==2){
for(int i = 1;i <= n; i++){
for(int j = 1;j <= n; j++){
sc.push_back(a[i][1] + a[j][2]);
}
}
}else{
for(int i = 1;i <= n; i++){
sc.push_back(a[i][1]);
}
}
sort(all(sc));
reverse(all(sc));
cout << sc[c-1];
// dp[0][0][0] = 1;
// for(int j = 1;j <= k; j++){
// for(int i = 1;i <= n; i++){
// for(int last_sc = 0; last_sc <= j * 50; last_sc++){
// dp[i][j][last_sc] = dp[i-1][j][last_sc];
// dp[i][j][last_sc + a[i][j]]+= dp[i-1][j-1][last_sc];
// }
// }
// }
// for(int i = 26; i >= 22; i--){
// cout << i << " = ";
// cout << dp[n][k][i] << '\n';
// }
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |