#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ff first
#define ss second
void solvr()
{
ll n;
cin >> n;
vector<ll> v(n);
vector<ll> b(n);
for(ll i = 0; i < n; i++)
{
cin >> v[i];
cin >> b[i];
}
sort(v.begin(), v.end());
sort(b.begin(), b.end());
cout << v[n/2] << " " << b[n/2] << endl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int t = 1;
//cin >> t;
while(t--)
{
solvr();
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 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 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
460 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 |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
13 ms |
1884 KB |
Output is correct |
2 |
Correct |
22 ms |
3044 KB |
Output is correct |
3 |
Correct |
22 ms |
3160 KB |
Output is correct |
4 |
Correct |
15 ms |
3164 KB |
Output is correct |
5 |
Correct |
17 ms |
3164 KB |
Output is correct |
6 |
Correct |
19 ms |
3160 KB |
Output is correct |
7 |
Correct |
19 ms |
3128 KB |
Output is correct |
8 |
Correct |
20 ms |
3176 KB |
Output is correct |
# |
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 |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
460 KB |
Output is correct |
# |
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 |
468 KB |
Output is correct |
6 |
Correct |
1 ms |
372 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
28 ms |
2040 KB |
Output is correct |
2 |
Correct |
30 ms |
3932 KB |
Output is correct |
3 |
Correct |
19 ms |
3932 KB |
Output is correct |
4 |
Correct |
28 ms |
3164 KB |
Output is correct |
5 |
Correct |
28 ms |
3928 KB |
Output is correct |
6 |
Correct |
28 ms |
3932 KB |
Output is correct |
7 |
Correct |
28 ms |
3952 KB |
Output is correct |
8 |
Correct |
28 ms |
3932 KB |
Output is correct |