Cod sursă (job #495672)

#include <cstdio>
#include <algorithm>
#include <bits/stdc++.h>

using namespace std;

int n,x,y,s,d,i,a[5000001],b[5000001];

int main(){
	freopen ("lalele.in","r",stdin);
    freopen ("lalele.out","w",stdout);
    scanf("%d",&n);
    
    while ( i<n ){ scanf("%d%d",&x,&y);
                      i+=x;
                  if ( y ){ for ( int j=1;j<=x;++j ){
                                                    a[++s]=y;
                                                    b[s]=++d;
                                                   }
                          }
                      else{  for ( int l=1;l<=s;++l ){
                										a[l]+=d-b[l];
                										b[l]=d;
                                                       }
                            for ( int j=1;j<=x;++j ){ ++d;
                                              nth_element(a+1,a+s/2+1,a+s+1);
                                              s=s/2;
                                              printf("%d\n",a[s+1]+d-b[s+1]); 
                                                 }
                         }
                   }
    return 0;
}