n = int(input())
a = [int(i) for i in input().split()]
m = int(input())
for i in range(m):
wire , bird = [int(j) for j in input().split()]
if wire < n:
a[wire] += a[wire - 1] - bird
if wire - 2 >= 0:
a[wire - 2] += bird - 1
a[wire - 1] = 0
for j in range(n):
print(a[j]) #include <bits/stdc++.h>
using namespace std;
int main() {
int n,value;
cin >> n;
int arr[n];
for (int i = 0; i < n; ++i) {
cin >> value;
arr[i] = value;
}
int t;
cin >> t;
while (t--){
int x , y;
cin >> x >> y;
x--;
if ( x == sizeof(arr)/4 - 1){
arr[x-1] += arr[x]-(arr[x] - y) - 1;
arr[x]=0;
}
else {
arr[x-1] += arr[x]-(arr[x] - y) - 1;
arr[x+1] += arr[x]-y;
arr[x] = 0;
}
}
for (int i = 0; i < sizeof(arr)/4; ++i) {
cout << arr[i] << endl;
}
return 0;
}
831B - Keyboard Layouts | 814A - An abandoned sentiment from past |
268C - Beautiful Sets of Points | 1391C - Cyclic Permutations |
11A - Increasing Sequence | 1406A - Subset Mex |
1365F - Swaps Again | 50B - Choosing Symbol Pairs |
1719A - Chip Game | 454B - Little Pony and Sort by Shift |
1152A - Neko Finds Grapes | 1719B - Mathematical Circus |
1719C - Fighting Tournament | 1642A - Hard Way |
285C - Building Permutation | 1719E - Fibonacci Strings |
1696C - Fishingprince Plays With Array | 1085A - Right-Left Cipher |
1508B - Almost Sorted | 1690C - Restoring the Duration of Tasks |
1055A - Metro | 1036D - Vasya and Arrays |
1139C - Edgy Trees | 37A - Towers |
353A - Domino | 409H - A + B Strikes Back |
1262A - Math Problem | 158C - Cd and pwd commands |
194A - Exams | 1673B - A Perfectly Balanced String |