Cod sursă (job #574475)

#include <iostream>
#include <fstream>
#include <algorithm>

#define mx 500001

using namespace std;

ifstream fin("lalele.in");
ofstream fout("lalele.out");

int n, nr, ziua[mx], h[mx], total;

int main()
{
    int zile, x;
    fin>>nr;
    while(fin>>zile>>x)
    {
        if(x)
        {
            for(int i=1;i<=zile;i++)
            {
                total++;
                ziua[++n]=total;
                h[n]=x;
            }
        }
        else
        {
            for(int i=1;i<=n;i++)
            {
                h[i]=h[i]+total-ziua[i];
                ziua[i]=total;
            }
            for(int i=1;i<=zile;i++)
            {
                total++;
                sort(h+1,h+n+1);
                fout<<h[1+n/2]+total-ziua[1+n/2]<<endl;
                n=n/2;
            }
        }
    }
}