# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
565078 | shahriarkhan | Best Place (NOI17_bestplace) | C++14 | 38 ms | 3248 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 ;
scanf("%d",&n) ;
vector<int> x , y ;
for(int i = 1 ; i <= n ; ++i)
{
int a , b ;
scanf("%d%d",&a,&b) ;
x.push_back(a) , y.push_back(b) ;
}
sort(x.begin(),x.end()) ;
sort(y.begin(),y.end()) ;
printf("%d %d\n",x[n/2],y[n/2]) ;
return 0 ;
}
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... |