Submission #1173888

#	Time	Username	Problem	Language	Result	Execution time	Memory
1173888		ezzzay	Best Place (NOI17_bestplace)	C++20	53 / 100	1095 ms	1864 KiB

bestplace

#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 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;
}

• Subtask 1: 3 / 3
• Subtask 2: 20 / 20
• Subtask 3: 0 / 28
• Subtask 4: 13 / 13
• Subtask 5: 17 / 17
• Subtask 6: 0 / 19