제출 #1006000

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1006000		andecaandeci	Best Place (NOI17_bestplace)	C++17	100 / 100	29 ms	2040 KiB

bestplace

#include <bits/stdc++.h>
typedef long double ld;
#define int long long
#define TC int t; cin >> t; for(int _=1; _<=t; _++)
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
#define ffl fflush(stdout)
using namespace std; 

int n;
vector<int> xx, yy;

int check(int x, int y){
   int ret = 0;
   for(int i=0; i<n; i++){
      ret+=(abs(x-xx[i])+abs(y-yy[i]));
   }return ret;
}

signed main(){
   ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
   cin >> n;
   xx.assign(n, 0); yy.assign(n, 0);
   for(int i=0; i<n; i++){
      cin >> xx[i] >> yy[i];
   }

   sort(xx.begin(), xx.end());
   sort(yy.begin(), yy.end());

   //cout << check(9, 10);

   int medx, medy;

   if(n%2==0){
      medx = (xx[n/2]+xx[(n+1)/2])/2;
      medy = (yy[n/2]+yy[(n+1)/2])/2;
   }else{
      medx = xx[n/2];
      medy = yy[n/2];
   }

   cout << medx << " " << medy;
}

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