Cod sursă (job #440571)

#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("lalele.in");
ofstream out("lalele.out");
long long int v[1000004], lenght=0, n, z, val, j, np, i, q;


int main()
{
    in>>n;
    while(n>0)
    {
        in>>z>>val;
        n-=z;
        if(val!=0)
        {

            for(i=1; i<=v[0]; i++)
                v[i]+=z;
            for(i=v[0]+1; i<=v[0]+z; i++)
                v[i]=val+(z-(i-v[0]));
            v[0]+=z;
        }
        else
        {
            sort(v+1, v+1+v[0]);
            for(i=1; i<=v[0]; i++)
                    v[i]+=z;;
            for(q=1; q<=z; q++)
            {
                out<<v[v[0]/2+1]-z+q<<endl;
                v[0]=v[0]-(v[0]-v[0]/2);
            }
        }
    }
    return 0;
}