oj.uz

Submission #862338

# Submission time Handle Problem Language Result Execution time Memory
862338 2023-10-18T04:56:20 Z maks007 Olympiads (BOI19_olympiads) C++14
0 / 100
 18 ms 1488 KB 
#include "bits/stdc++.h"
 
using namespace std;
 
signed main () {
	int n, m, k;
	cin >> n >> m >> k;
	assert(m == 2);
	int a[n][m];
	for(int i = 0; i < n; i ++) {
		for(int j = 0; j < m; j ++) {
			cin >> a[i][j];
		}
	}
	vector <int> v;
	for(int i = 0; i < n; i ++) {
		for(int j = 0; j < n; j ++) {
			v.push_back(a[i][0] + a[j][1]);
		}
	}
	sort(v.rbegin(), v.rend());
	assert(v.size()  == n * n);
	cout << v[k-1];
	return 0;
}

Subtask #1
0 / 13.0

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

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

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