제출 #1005985

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1005985		kebine	Best Place (NOI17_bestplace)	C++17	3 / 100	21 ms	1884 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 = (xx[0]+xx[n-1])/2;
   int medy = (yy[0]+yy[n-1])/2;

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

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