oj.uz

답안 #124894

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
124894 2019-07-04T05:44:56 Z 윤교준(#3050) Olympiads (BOI19_olympiads) C++14
13 / 100
 12 ms 1016 KB 
#include <bits/stdc++.h>
#define eb emplace_back
#define sz(V) ((int)(V).size())
#define befv(V) ((V)[sz(V)-2])
#define allv(V) ((V).begin()),((V).end())
#define sorv(V) sort(allv(V))
#define revv(V) reverse(allv(V))
#define upmax(a,b) (a)=max((a),(b))
#define INF (0x3f3f3f3f)
using namespace std;
typedef long long ll;

int A[505][3];

vector<int> V;

int N, K, C;

int main() {
	ios::sync_with_stdio(false);

	cin >> N >> K >> C;
	for(int i = 1; i <= N; i++) for(int j = 1; j <= K; j++)
		cin >> A[i][j];
	
	if(1 == K) {
		for(int i = 1; i <= N; i++)
			V.eb(A[i][1]);
	} else {
		for(int i = 1; i < N; i++) for(int j = i+1; j <= N; j++)
			V.eb(max(A[i][1], A[j][1]) + max(A[i][2], A[j][2]));
	}
	
	sorv(V); revv(V);
	cout << V[C-1] << endl;
	return 0;
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 1016 KB Output is correct
2 Correct 10 ms 1012 KB Output is correct
3 Correct 8 ms 1016 KB Output is correct
4 Correct 5 ms 1016 KB Output is correct

Subtask #2
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 1016 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 1016 KB Output is correct
2 Correct 10 ms 1012 KB Output is correct
3 Correct 8 ms 1016 KB Output is correct
4 Correct 5 ms 1016 KB Output is correct
5 Incorrect 2 ms 376 KB Output isn't correct
6 Halted 0 ms 0 KB -