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>
#define ll long long
using namespace std;
int main()
{
ll n;
cin>>n;
if(n==2){
ll k,m,d,l;
cin>>k>>m>>d>>l;
cout<<(k+d)/2<<(m+l);
}
else{
vector<ll> x(n);
vector<ll> y(n);
for(ll i=0;i<n;i++){
cin>>x[i]>>y[i];
}
sort(x.begin(),x.end());
sort(y.begin(),y.end());
cout<<x[n/2]<<' '<<y[n/2];
}
}
# | 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... |