Submission #377236

#	Time	Username	Problem	Language	Result	Execution time	Memory
377236		soroush	Olympiads (BOI19_olympiads)	C++17	13 / 100	9 ms	1008 KiB

olympiads

/*
#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,fma")
*/
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int , int> pii;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int maxn = 510;
const ll mod = 1e9+7;
const ld PI = acos((ld)-1);

#define pb push_back
#define endl '\n'
#define dokme(x) cout << x , exit(0)
#define migmig ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define ms(x , y) memset(x , y , sizeof x)
ll pw(ll a, ll b, ll md = mod){ll res = 1;while(b){if(b&1){res=(a*res)%md;}a=(a*a)%md;b>>=1;}return(res);}

int n , k , c;
int a[maxn][10];

vector < int > score;

void solve(int k){
	if(k == 1){
		for(int i = 1 ; i <= n ; i ++)score.pb(a[i][0]);
	}
	if(k == 2){
		for(int i = 1 ; i <= n ; i ++)
			for(int j = 1 ; j < i ; j ++)
				score.pb(max(a[i][0] , a[j][0]) + max(a[i][1] , a[j][1]));
	}
}

int32_t main(){
	migmig;
	cin >> n >> k >> c;
	assert(k <= 2);
	for(int i = 1 ; i <= n ; i ++)
		for(int j = 0 ; j < k ; j ++)
			cin >> a[i][j];
	solve(k);
	sort(score.begin() , score.end());
	reverse(score.begin() , score.end());
	cout << score[c - 1];
	return(0);
}

• Subtask 1: 13 / 13
• Subtask 2: 0 / 31
• Subtask 3: 0 / 24
• Subtask 4: 0 / 32