oj.uz

Submission #931734

# Submission time Handle Problem Language Result Execution time Memory
931734 2024-02-22T10:16:02 Z accord Best Place (NOI17_bestplace) C++14
100 / 100
 79 ms 1364 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n; cin >> n;
	int x[n], y[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] << "\n";
}

Subtask #1
3.0 / 3.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 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 1 ms 344 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 344 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 52 ms 1144 KB Output is correct
2 Correct 55 ms 1188 KB Output is correct
3 Correct 55 ms 1116 KB Output is correct
4 Correct 51 ms 1116 KB Output is correct
5 Correct 51 ms 1188 KB Output is correct
6 Correct 55 ms 1188 KB Output is correct
7 Correct 54 ms 1180 KB Output is correct
8 Correct 47 ms 1116 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 608 KB Output is correct
2 Correct 0 ms 356 KB Output is correct
3 Correct 0 ms 352 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 616 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 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 2 ms 436 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 1188 KB Output is correct
2 Correct 72 ms 1188 KB Output is correct
3 Correct 62 ms 1364 KB Output is correct
4 Correct 56 ms 1188 KB Output is correct
5 Correct 71 ms 1272 KB Output is correct
6 Correct 79 ms 1188 KB Output is correct
7 Correct 79 ms 1184 KB Output is correct
8 Correct 75 ms 1116 KB Output is correct