#include #include #include using namespace std; using namespace atcoder; using mint = modint998244353; #define rep(i,n) for (int i = 0; i < (n); ++i) #define Inf32 1000000005 #define Inf64 1000000000000000001LL //[[l,r],v] l<=x<=rは, floor(N/x)=v vector,long long>> get_floor(long long N){ vector,long long>> ret; for(long long i=1;i<=N;i++){ long long v = N/i; ret.emplace_back(make_pair(i,0),v); i = N/v; ret.back().first.second = i; } return ret; } const int Sz = 2000005; int lower[Sz],upper[Sz]; int main(){ int n; cin>>n; vector> s(n); rep(i,n){ scanf("%lld",&s[i].first); s[i].second = i; } sort(s.begin(),s.end()); vector t(n); rep(i,n)t[i] = s[i].first; rep(i,Sz)lower[i] = n, upper[i] = n; for(int i=n-1;i>=0;i--){ if(t[i] < Sz){ lower[t[i]] = i; } if(t[i]-1= i){ lower[i] = j; break; } } rep(j,n){ if(t[j]>i){ upper[i] = j; break; } } } */ for(int i=Sz-2;i>=0;i--){ upper[i] = min(upper[i],upper[i+1]); lower[i] = min(lower[i],lower[i+1]); } vector imos(n+1); { int q; cin>>q; vector v; long long last = -1; rep(i,q){ long long x,y; cin>>x>>y; if(last < x){ last = x + y; v.push_back(y); } else{ last += y; v.back() += y; } } rep(i,v.size()){ auto r = get_floor(v[i]); for(auto p:r){ long long l = p.first.first; long long r = p.first.second; long long val = p.second; int li,ri; if(l ans(n); rep(i,n){ ans[s[i].second] = imos[i]; } rep(i,n)printf("%lld\n",ans[i]); return 0; }