#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int n, a, b;
vector<int> x;
vector<int> y;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
x.push_back(a);
y.push_back(b);
}
sort(x.begin(), x.end());
sort(y.begin(), y.end());
cout << x[n / 2] << " " << y[n / 2] << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 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 |
320 KB |
Output is correct |
# |
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 |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
18 ms |
2396 KB |
Output is correct |
2 |
Correct |
27 ms |
2528 KB |
Output is correct |
3 |
Correct |
24 ms |
2504 KB |
Output is correct |
4 |
Correct |
18 ms |
2492 KB |
Output is correct |
5 |
Correct |
21 ms |
2496 KB |
Output is correct |
6 |
Correct |
24 ms |
2376 KB |
Output is correct |
7 |
Correct |
24 ms |
2348 KB |
Output is correct |
8 |
Correct |
25 ms |
2492 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 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 |
320 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
320 KB |
Output is correct |
# |
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 |
1 ms |
328 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
328 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
34 ms |
3268 KB |
Output is correct |
2 |
Correct |
36 ms |
3300 KB |
Output is correct |
3 |
Correct |
25 ms |
3272 KB |
Output is correct |
4 |
Correct |
31 ms |
2496 KB |
Output is correct |
5 |
Correct |
33 ms |
3136 KB |
Output is correct |
6 |
Correct |
34 ms |
3204 KB |
Output is correct |
7 |
Correct |
35 ms |
3208 KB |
Output is correct |
8 |
Correct |
34 ms |
3136 KB |
Output is correct |