oj.uz

Submission #862396

# Submission time Handle Problem Language Result Execution time Memory
862396 2023-10-18T07:48:13 Z iskhakkutbilim Olympiads (BOI19_olympiads) C++17
13 / 100
 9 ms 1500 KB 
#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 = i + 1;j <= n; j++){
				sc.push_back(max(a[i][1], a[j][1]) + max(a[j][2], a[i][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

olympiads.cpp:15:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   15 | main(){
      | ^~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1500 KB Output is correct
2 Correct 8 ms 1500 KB Output is correct
3 Correct 5 ms 1500 KB Output is correct
4 Correct 3 ms 1500 KB Output is correct

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1500 KB Output is correct
2 Correct 8 ms 1500 KB Output is correct
3 Correct 5 ms 1500 KB Output is correct
4 Correct 3 ms 1500 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -