Cod sursă (job #95566)

#include<stdio.h>
#include<algorithm>
using namespace std;
int v[2000001];
int main(){
    int k,z,x,i,p,d,minim;
    freopen("lalele.in","r",stdin);
    freopen("lalele.out","w",stdout);
    scanf("%d",&z);
    k=0;
    while(z>0){
        scanf("%d%d",&d,&x);
        z-=d;
        if(x!=0){
            while(d!=0){
                for(i=1;i<=k;i++)
                    v[i]++;
                k++;
                v[k]=x;
                d--;
            }
        }
        else{
            while(d!=0){
                for(i=1;i<=k;i++)
                    v[i]++;
                sort(v+1,v+k+1);
                if(k%2==1)
                    p=(k+1)/2;
                else
                    p=k/2;
                minim=999999999;
                for(i=k;i>=k-p+1;i--)
                    if(v[i]<minim)
                        minim=v[i];
                k=k-p;d--;
                printf("%d\n",minim);
            }
        }
    }
    return 0;
}