Submission #966055

#TimeUsernameProblemLanguageResultExecution timeMemory
966055detectivebowonBest Place (NOI17_bestplace)C++14
100 / 100
70 ms7004 KiB
#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,x[100007],y[1000007],ans,ansx,ansy,sumx,sumy;
signed main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>x[i]>>y[i];
    } 
    sort(x+1,x+1+n);
    sort(y+1,y+1+n);
    if(n%2!=0)
        cout<<x[n/2+1]<<" "<<y[n/2+1];
    else
        cout<<(x[n/2]+x[n/2+1])/2<<" "<<(y[n/2]+y[n/2+1])/2;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...