Cod sursă (job #495345)

#include<bits/stdc++.h>
using namespace std;
ifstream fin ("lalele.in");
ofstream fout ("lalele.out");
int n,d,x,nr,a[5000010];
int main(){
	ifstream cin("lalele.in");
    ofstream cout("lalele.out");
    cin>>n;
    while(n){
        cin>>d>>x;
        if(x!=0){
            for(int j=1;j<=nr;j++)
                a[j]+=d;
            for(int j=1;j<=d;j++)
                a[++nr]=x++;
        }
        else{
            sort(a+1,a+1+nr);
            for(int j=1;j<=d;j++){
                for(int j=1;j<=nr;j++)
                    a[j]+=1;
                int mij=(nr+1)/2;
                cout<<a[mij+1]<<'\n';
                nr-=mij;
            }
        }
        n-=d;
    }
    return 0;
}