Cod sursă (job #486224)

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

using namespace std;
ifstream in ("lalele.in");
ofstream out ("lalele.out");
int n,i,j,m,v[5000001],x,y,k,q[500000];
int main()
{
in>>n;
int s=0;
i=1;
int p=1;

while(in>>x>>y)
{
if(y!=0){
        s=s+x;
    y=y-s;
for(j=1;j<=x;j++)
{q[p]=y+j-1;
    p++;
}
}
if(y==0){for(i=1;i<=x;i++){ s++;if(p%2==1)p++;nth_element(q+1,q+p/2,q+p);p=p/2;  out<<q[p]+s<<"\n";}     }




}










    return 0;
}