Cod sursă (job #699605)

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream f("lalele.in");
ofstream g("lalele.out");
int lalele[5000001];
int main(){
    int n;
    f>>n;
    int d,x,holder=0,sizee=0;
    while(f>>d>>x){
        if(x){
            holder+=d;
            for(int i=1;i<=d;++i){
                lalele[++sizee]=x-holder+i-1;
            }
        }
        else{
            for(int i=1;i<=d;++i){
                ++holder;
                nth_element(lalele+1,lalele+1+sizee-(sizee+1)/2,lalele+sizee+1);
                g<<lalele[sizee-(sizee+1)/2+1]+holder<<'\n';
                sizee-=(sizee+1)/2;
            }
        }
    }
    return 0;
}