Pagini recente » Cod sursa (job #2681288) | Monitorul de evaluare | Cod sursa (job #2637520) | Cod sursa (job #2096546) | Cod sursa (job #1240974)
#include<stdio.h>
#include <list>
#include<fstream>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
int main(){
int n, m, v[15001], s, p, q, k,i,j,sum=0;
f >> n >> m;
for (i = 1; i <= n; i++){
f >> v[i];
sum += v[i];
}
for (i = 1; i <= m; i++){
s = 0;
f >> k>>p>>q;
if (k == 1){
for (j = 1; j < p; j++)
s += v[j];
for (j = q + 1; j <= n; j++)
s += v[j];
g << sum-s<<'\n';
}
else{
v[p] -= q;
sum -= q;
}
}
getchar();
return 0;
}