제출 #681858

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
681858		dsyz	Best Place (NOI17_bestplace)	C++17	100 / 100	48 ms	3800 KiB

bestplace

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
  ios_base::sync_with_stdio(false);cin.tie(0);
  ll N;
  cin>>N;
  ll arr[N];
  ll arr2[N];
  for(ll i = 0;i < N;i++){
    ll a,b;
    cin>>a>>b;
    arr[i] = a;
    arr2[i] = b;
    // arr[i].second.first = a;
    // arr[i].second.second = b;
    // arr[i].first = a + b; 
  }
  sort(arr,arr + N);
  sort(arr2,arr2 + N);
  if(N % 2 == 0){
    ll sum1 = (arr[(N / 2) - 1] + arr[(N / 2)]) / 2;
    ll sum2 =  (arr2[(N / 2) - 1] + arr2[(N / 2)]) / 2;  
    //ll sum1 = (arr[(N / 2) - 1].second.first + arr[(N / 2)].second.first) / 2;
    //ll sum2 = (arr[(N / 2) - 1].second.second + arr[(N / 2)].second.second) / 2;
    cout<<sum1<<" "<<sum2<<'\n';
  }else if(N % 2 == 1){
    //cout<<N / 2<<'\n';
    ll sum1 = arr[N / 2];
    ll sum2 = arr2[N / 2];
    cout<<sum1<<" "<<sum2<<'\n';
  }  
}

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