oj.uz

Submission #888474

# Submission time Handle Problem Language Result Execution time Memory
888474 2023-12-17T13:59:35 Z kabgoy Best Place (NOI17_bestplace) C++17
100 / 100
 68 ms 3160 KB 
#include <bits/stdc++.h>
using namespace std;

int
main(void)
{
	int n;
	cin >> n;
	vector<int> x(n), y(n);
	for(int i = 0; i < n; i++)
		cin >> x[i] >> y[i];
	sort(x.begin(), x.end());
	sort(y.begin(), y.end());
	cout << x[n/2] << ' ' << y[n/2] << '\n';
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 432 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 2288 KB Output is correct
2 Correct 46 ms 2368 KB Output is correct
3 Correct 46 ms 2372 KB Output is correct
4 Correct 41 ms 2396 KB Output is correct
5 Correct 44 ms 2140 KB Output is correct
6 Correct 45 ms 2128 KB Output is correct
7 Correct 44 ms 2128 KB Output is correct
8 Correct 46 ms 2228 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 344 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 2896 KB Output is correct
2 Correct 68 ms 2900 KB Output is correct
3 Correct 58 ms 3156 KB Output is correct
4 Correct 52 ms 2348 KB Output is correct
5 Correct 67 ms 2896 KB Output is correct
6 Correct 68 ms 3160 KB Output is correct
7 Correct 66 ms 2896 KB Output is correct
8 Correct 66 ms 2988 KB Output is correct