#include<bits/stdc++.h>
#define vi vector<int>
#define all(v) v.begin(),v.end()
using namespace std;
void solve(int tc)
{
int n; cin >> n;
vi x(n),y(n);
for(int i = 0; i < n; i++)
{
cin >> x[i] >> y[i];
}
sort(all(x)), sort(all(y));
int X = x[n/2], Y = y[n/2];
cout << X << ' ' << Y << "\n";
}
int main()
{
int tc = 1;
for(int t = 0; t < tc; t++)
{
solve(t);
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
52 ms |
1060 KB |
Output is correct |
2 |
Correct |
60 ms |
1068 KB |
Output is correct |
3 |
Correct |
69 ms |
1064 KB |
Output is correct |
4 |
Correct |
57 ms |
972 KB |
Output is correct |
5 |
Correct |
60 ms |
1080 KB |
Output is correct |
6 |
Correct |
60 ms |
972 KB |
Output is correct |
7 |
Correct |
56 ms |
1072 KB |
Output is correct |
8 |
Correct |
59 ms |
972 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
0 ms |
292 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
0 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
308 KB |
Output is correct |
3 |
Correct |
2 ms |
304 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
2 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
95 ms |
972 KB |
Output is correct |
2 |
Correct |
87 ms |
2980 KB |
Output is correct |
3 |
Correct |
82 ms |
2980 KB |
Output is correct |
4 |
Correct |
73 ms |
2216 KB |
Output is correct |
5 |
Correct |
87 ms |
2968 KB |
Output is correct |
6 |
Correct |
87 ms |
2964 KB |
Output is correct |
7 |
Correct |
87 ms |
2964 KB |
Output is correct |
8 |
Correct |
88 ms |
2984 KB |
Output is correct |