#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define rep1(a, i) for(int i = 1; i <= (a); i++)
#define pi pair<int, int>
#define fi first
#define se second
int mod = 1e9+7;
signed main(){
int n; cin >> n;
vector<int> a(n+1);
rep1(n, i) cin >> a[i];
int q; cin >> q;
vector<int> pf(n+1, 0);
for(int i = 1; i <= n; i++){
pf[i] = pf[i-1] + a[i];
}
while(q--){
int t; cin >> t;
if(t == 1){
for(int i = 1; i < n; i++){
if(a[i] > a[i+1]) swap(a[i], a[i+1]);
}
pf[1] = a[1];
for(int i = 2; i <= n; i++){
pf[i] = pf[i-1] + a[i];
}
}
if(t == 2){
int l, r; cin >> l >> r;
//cout << r << ' ' << l << ' ';
cout << pf[r] - pf[l-1] << '\n';
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |