# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1006021 | christinelynn | Best Place (NOI17_bestplace) | C++17 | 67 ms | 2208 KiB |
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
signed main(){
int n;
cin>>n;
vector<int>x,y;
for(int q=1;q<=n;q++){
int w,e;
cin>>w>>e;
x.push_back(w);
y.push_back(e);
}
sort(x.begin(),x.end());
sort(y.begin(),y.end());
int ansx=1e18;
if(n%2==1){
cout<<x[n/2]<<" "<<y[n/2]<<endl;
}
else{
cout<<x[n/2 -1]<<" "<<y[n/2-1]<<endl;
}
}
Compilation message (stderr)
# | 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... |