Submission #2384417

---

Source Code Expand

// Many Medians

#define NODEBUG

#include<iostream>
#include<vector>
#include<algorithm>
#include<iterator>
#include<cassert>

using namespace std;

using X_type = int32_t;

int main(){
        size_t N;
        cin >> N;
        assert(N%2==0);

        vector<X_type> X;
        X.reserve(N);
        copy_n(istream_iterator<X_type>{cin}, N, back_inserter(X));

        auto mid = X.begin()+(N/2);
        X_type max_cand = (nth_element(X.begin(), mid, X.end()), *mid);
        mid = X.begin()+(N/2)-1;
        X_type min_cand = (nth_element(X.begin(), mid, X.end()), *mid);
        for (size_t i = 0; i < N; ++i){
                cout << (X[i]<=min_cand ? max_cand : min_cand) << '\n';
        }

        cout.flush();
        return 0;
}

Submission Info

Judge Result