# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1108971 | vjudge1 | Best Place (NOI17_bestplace) | C++17 | 50 ms | 2888 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;
int main (){
int n;
cin>>n;
vector<int>v(n);
vector<int>vec(n);
for(int i=0;i<n;++i){
int x,y;
cin>>v[x];
cin>>vec[y];
}
sort(v.begin(),v.end());
sort(vec.begin(),vec.end());
cout<<v[n/2+1]<<" "<<vec[n/2+1];
}
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... |