CF 272 C. Dima and Staircase

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn=100002;
ll h[maxn],hi,wi,mx;
int n,m;
int main()
{
//freopen("D://input.txt","r",stdin);
while(scanf("%d",&n)!=EOF)
{
int i,j;
for(mx=i=0;i<n;i++)cin>>h[i+1];
scanf("%d",&m);
while(m--)
{
cin>>wi>>hi;
mx=max(mx,h[wi]);
cout<<mx<<endl;
mx=mx+hi;
}
}
return 0;
}