This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
//#define size size()
const int mod = 1000 * 1000 * 1000 + 7;
const int N = 100005;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin>>n;
int a[n] , b[n];
for (int i = 0; i < n; ++i) {
cin>>a[i]>>b[i];
}
vector<pair<int, int > > v;
for (int i = 0; i < n; ++i) {
v.push_back({a[i],b[i]});
}
sort(v.begin(), v.end());
cout<<v[n/2].first<<" "<<v[n/2-1].second<<endl;
//cout<<v[n/2].second;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |