Submission #2854260

---

Source Code Expand

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

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    long n;
    // vector<int> x;
    cin >> n;

    vector<long> a;
    // long a[n];
    long tmp;
    for (int i = 0; i < n; ++i) {
        cin >> tmp;
        a.push_back(tmp);
    };
    sort(a.begin(), a.end());
    long max_val = a[n - 1];
    decltype(a)::iterator large_med;
    decltype(a)::iterator small_med;
    decltype(a)::iterator nearest_med;
    auto true_med = static_cast<long>(round(max_val / 2.0));
    large_med  = lower_bound(a.begin(), a.end(), true_med);

    long large_pos = 0;
    for (auto &num : a) {
        if (num == *large_med) break;
        large_pos++;
    }
    // long small_pos = 0;
    // if (large_pos > 0) {
    //     small_pos = large_pos - 1;
    // } else {
    //     small_pos = large_pos;
    // }

    long med_val;
    if (large_pos == n - 1) {
        med_val = a[large_pos - 1];
    } else if (large_pos == 0) {
        med_val = a[large_pos];
    } else if (a[large_pos] - true_med > true_med - a[large_pos - 1]) {
        med_val = a[large_pos - 1];
    } else {
        med_val = a[large_pos];
    }
    cout  << max_val << ' ' << med_val << "\n";

    return 0;
}

Submission Info

Judge Result