[第1章 1.5t2] 中位数

#include 
#define endl '\n'
using namespace std;
typedef long long ll;
int main(){
    ll n;
    cin>>n;
    priority_queue r;
    priority_queue,greater<>> l;
    ll tmp;
    cin>>tmp;
    cout<>tmp;
        if(tmp>r.top())l.push(tmp);
        else r.push(tmp);
        while(r.size()>l.size()+1){
            l.push(r.top());r.pop();
        }
        while(l.size()>r.size()+1){
            r.push(l.top());l.pop();
        }
        if(i%2==0)cout<<(l.size()>r.size()?l.top():r.top())<