#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
// B O I
// 1 2 3
void solve(){
ll n;
cin>>n;
vector<ll> vt(n+1);
vector<ll> pref(n+1,0);
for(ll i=1;i<=n;i++){
cin>>vt[i];
pref[i]+=pref[i-1]+vt[i];
}
ll q;
cin>>q;
while(q--){
ll t;
cin>>t;
if(t==1){
// swap
for(ll i=1;i<n;i++){
if(vt[i]>vt[i+1]){
swap(vt[i],vt[i+1]);
}
}
// for(auto &e:vt)
// cout<<e<<" ";
// cout<<endl;
for(ll i=1;i<=n;i++){
pref[i]=0;
pref[i]+=pref[i-1]+vt[i];
}
}else{
// sum query
ll l,r;
cin>>l>>r;
cout<<pref[r]-pref[l-1]<<endl;
}
}
}
int main(){
ios_base::sync_with_stdio(NULL);
cin.tie(0);
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
solve();
}
# | 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... |