import sys
input = sys.stdin.readline
n, q = map(int, input().split())
a = list(map(int, input().split()))
s = sum(a)
marker = {}
for i in range(n):
marker[i+1] = a[i]
x = 0
for _ in range(q):
k = list(map(int, input().split()))
if k[0] == 1:
s += k[2] - marker.get(k[1], x)
marker[k[1]] = k[2]
else:
marker.clear()
s = k[1] * n
x = k[1]
print(s)#include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main(){
ll n, q;
cin >> n >> q;
ll sum = 0;
map <int, pair<int, int>> m; //m[index] = {time, value}
// m[n] = {all changed time, value}
for(int i = 0; i < n; ++i){
ll a;
cin >> a;
sum += a;
m[i] = {-1, a};
}
m[n] = {-1, 0};
for(int i = 0; i < q; ++i){
int t;
cin >> t;
if(t == 1){
int ix, x;
cin >> ix >> x;
--ix;
auto [time, value] = m[ix];
auto [allChangedTime, allChangedValue] = m[n];
if(time < allChangedTime){
sum -= allChangedValue;
}else sum -= value;
sum += x;
m[ix] = {i, x};
}else{
int x;
cin >> x;
sum = n * x;
m[n] = {i, x};
}
cout << sum << "\n";
}
return 0;
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?), set tle
* do something instead of nothing and stay organized
*/
682. Baseball Game | 496. Next Greater Element I |
232. Implement Queue using Stacks | 844. Backspace String Compare |
20. Valid Parentheses | 746. Min Cost Climbing Stairs |
392. Is Subsequence | 70. Climbing Stairs |
53. Maximum Subarray | 1527A. And Then There Were K |
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers | 318. Maximum Product of Word Lengths |
448. Find All Numbers Disappeared in an Array | 1155. Number of Dice Rolls With Target Sum |
415. Add Strings | 22. Generate Parentheses |
13. Roman to Integer | 2. Add Two Numbers |
515. Find Largest Value in Each Tree Row | 345. Reverse Vowels of a String |
628. Maximum Product of Three Numbers | 1526A - Mean Inequality |
1526B - I Hate 1111 | 1881. Maximum Value after Insertion |
237. Delete Node in a Linked List | 27. Remove Element |
39. Combination Sum | 378. Kth Smallest Element in a Sorted Matrix |
162. Find Peak Element | 1529A - Eshag Loves Big Arrays |