# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
595975 | chinmoy_101 | Best Place (NOI17_bestplace) | C++14 | 0 ms | 0 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 ll long long int
int main()
{
ll n
cin>>n;
ll arr[n];
ll ar[n];
for(ll i=0; i<n; i++)
{
cin>>arr[i] >>ar[i];
}
sort(arr, arr+n);
sort(ar, ar+n);
cout<<arr[n/2] <<" " <<ar[n/2];
return 0;
}