Cod sursă (job #495548)

#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("lalele.in");
ofstream cout("lalele.out");
int v[50000001];
int main()
{
    int n,d,x,k=0,i;
    cin>>n;
    while(n)
    {
        cin>>d>>x;
        if(x==0){
                sort(v+1,v+k+1);
            while(d)
        {
            for(i=1;i<=k;i++)
                v[i]++;
            cout<<v[k/2+1]<<'\n';
            k/=2;
            d--;
            n--;
        }
        }
        else
         while(d)
        {
            k++;
            v[k]=x;
            for(i=1;i<k;i++)
                v[i]++;
            d--;
            n--;
        }
        
        
        
        
        
    }
    return 0;
}