oj.uz

Submission #559695

# Submission time Handle Problem Language Result Execution time Memory
559695 2022-05-10T12:15:27 Z Garguy22 Best Place (NOI17_bestplace) C++17
100 / 100
 108 ms 3024 KB 
#include <iostream>
#include <algorithm>
using namespace std;

const int MAXN = 1e5 + 7;

int x[MAXN], y[MAXN];

int main(){

	int n;
	cin >> n;
	for(int i = 0; i < n; i++) cin >> x[i] >> y[i];
	sort(x, x + n);
	sort(y, y + n);
	cout << x[n/2] << " " << y[n/2] << endl;

}

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 2100 KB Output is correct
2 Correct 66 ms 2184 KB Output is correct
3 Correct 61 ms 2120 KB Output is correct
4 Correct 59 ms 2144 KB Output is correct
5 Correct 66 ms 2124 KB Output is correct
6 Correct 62 ms 2180 KB Output is correct
7 Correct 56 ms 2044 KB Output is correct
8 Correct 62 ms 2124 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 2992 KB Output is correct
2 Correct 86 ms 3000 KB Output is correct
3 Correct 85 ms 2952 KB Output is correct
4 Correct 71 ms 2208 KB Output is correct
5 Correct 89 ms 2924 KB Output is correct
6 Correct 93 ms 3024 KB Output is correct
7 Correct 96 ms 2960 KB Output is correct
8 Correct 108 ms 2916 KB Output is correct