제출 #632500

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
632500		mannshah1211	Best Place (NOI17_bestplace)	C++14	100 / 100	96 ms	3788 KiB

bestplace

#include <bits/stdc++.h>
using namespace std;

int main(){
  long long n;
  cin >> n;
  
  long long x[n], y[n];
  for(long long i = 0; i < n; i++){
    cin >> x[i] >> y[i];
  }
  
  sort(x, x + n);
  sort(y, y + n);
  
  if(n % 2 == 1){
    cout << x[(n - 1)/2] << ' ' << y[(n - 1)/2];
  } else{
    long long sum1 = 0;
    long long sum2 = 0;
    long long opt1x = (x[n/2 - 1] + x[n/2])/2;
    long long opt1y = (y[n/2 - 1] + y[n/2])/2;
    
    for(long long i = 0; i < n; i++){
      sum1 += abs(opt1x - x[i]) + abs(opt1y - y[i]);
      sum2 += abs(opt1x - x[i] + 1) + abs(opt1y - y[i] + 1);
    }
    
    if(sum1 > sum2){
      cout << opt1x + 1 << ' ' << opt1y + 1;
    } else{
      cout << opt1x << ' ' << opt1y;
    }
  }
}

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