Submission #1059099

#	Time	Username	Problem	Language	Result	Execution time	Memory
1059099		vjudge1	Best Place (NOI17_bestplace)	C++14	100 / 100	23 ms	3416 KiB

bestplace

/*
        Discord: powder7854
        https://www.facebook.com/hai290605
        https://codeforces.com/profile/Etohari
        https://oj.vnoi.info/user/powder
*/
#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"

//@Etohari
using namespace std;
using namespace __gnu_pbds;

template < class T, class G > bool minimum(T& a, const G b) { return b < a ? a = b, 1 : 0; }
template < class T, class G > bool maximum(T& a, const G b) { return a < b ? a = b, 1 : 0; }

template < class T > using heap_min = priority_queue < T, vector < T >, greater < T > >;
template < class T > using heap_max = priority_queue < T, vector < T >, less < T > >;
template < class T > using ordered_set = tree < T, null_type, less < T >, rb_tree_tag, tree_order_statistics_node_update >;
template < class T > using ordered_multiset = tree < T, null_type, less_equal < T >, rb_tree_tag, tree_order_statistics_node_update >;

#define my_wife "Thu"
#define bit(mask,i) ((mask>>i)&1)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define uniquev(v) sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define __lcm(a,b) ((int64_t)(a) / __gcd((a), (b)) * (b))
#define rand(l, r) uniform_int_distribution < int64_t > (l, r)(rng)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

constexpr int32_t MOD = 1e9 + 7;
constexpr int32_t MAXN = 1e6 + 10;
constexpr int32_t MAXM = 1e6 + 10; 
constexpr int32_t INF32 = 0x3f3f3f3f;
constexpr int64_t INF64 = 0x3f3f3f3f3f3f3f3f;

constexpr int16_t DR[] = { };
constexpr int16_t DC[] = { };

signed main() {
        cin.tie(nullptr)->sync_with_stdio(false);

        int n;
        cin >> n;
        
        vector < int > x(n), y(n);
        for (int i = 0; i < n; i ++) {
                cin >> x[i] >> y[i];
        }

        sort(all(x));
        sort(all(y));
        
        if (n & 1) {
                cout << x[n / 2] << " " << y[n / 2];
        }else {
                cout << (x[n / 2] + x[n / 2 - 1]) / 2 << " " << (y[n / 2] + y[n / 2 - 1]) / 2;
        }
        
        return (0 ^ 0);
}

/* Cho tới khi nào ? */

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