제출 #587447

#제출 시각아이디문제언어결과실행 시간메모리
587447gg123_peBest Place (NOI17_bestplace)C++14
3 / 100
1086 ms3660 KiB
#include <bits/stdc++.h>
using namespace std; 

typedef long long ll; 
#define f(i,a,b) for(int i = a; i < b; i++)
const int N = 1e5 + 5; 
const ll inf = 2e18; 


int n; 
ll a[N], b[N]; 

int main(){
    cin >> n; 

    f(i,1,n+1) cin >> a[i] >> b[i]; 

    ll ans = inf, x, y; 

    f(i,1,n+1){
        ll res = 0; 

        f(j,1,n+1){
            res += abs(a[j]-a[i]) + abs(b[j]-b[i]);
        }
        if(res < ans){
            x = a[i], y = b[i]; 
        }
    }

    cout << x << " " << y  << "\n";
    return 0; 
}
#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...