#include<bits/stdc++.h>
using namespace std;
#define ff first
#define int long long
#define ss second
#define pb push_back
const int N=555;
int dp[N];
int a[N];
int tmp[N];
signed main(){
int n;
cin>>n;
vector<int>x(n),y(n);
for(int i=0;i<n;i++){
cin>>x[i]>>y[i];
}
sort(x.begin(),x.end());
sort(y.begin(),y.end());
int h=n/2;
cout<<x[h]<<" "<<y[h];
return 0;
int X=0;
int p=1e15,f=1e15;
for(int i=0;i<n;i++){
int h=0;
for(int j=0;j<n;j++){
h+= abs(x[i]-x[j]);
}
if(p>h)X=x[i];
p=min(p,h);
}
int Y=0;
for(int i=0;i<n;i++){
int h=0;
for(int j=0;j<n;j++){
h+= abs(y[i]-y[j]);
}
if(f>h)Y=y[i];
f=min(f,h);
}
cout<<X<<" "<<Y;
}
# | 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... |