//#ifndef khos //#pragma GCC optimize ("Ofast") //#pragma GCC optimize ("unroll-loops") //#endif #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #ifdef khos #include "t_debug.cpp" #else #define debug(...) 42 #endif using namespace std; using namespace __gnu_pbds; template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; template<typename T> using indexed_multiset = tree<pair<int,int>, null_type, less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update>; #define int int64_t #define vi vector #define ss second #define ff first #define TESTCASES #define all(x) (x).begin(), (x).end() const int mod = 1e9+7; const int MAXN=2000000+5; const int inf=1e18; void solution() { int n; cin >> n; vi<int> a(n); for(auto &x:a)cin >> x; vi<int> pref(n); pref[0]=a[0]; for(int i=1; i<n; i++)pref[i]=pref[i-1]+a[i]; int q; cin >> q; while(q--){ int op; cin >> op; if(op==1){ for(int i=0; i<n-1; i++){ if(a[i]>a[i+1])swap(a[i], a[i+1]); } pref[0]=a[0]; for(int i=1; i<n; i++)pref[i]=pref[i-1]+a[i]; } else { int l, r; cin >> l >> r; -- l, -- r; cout << pref[r]-(l==0?0:pref[l-1]) << '\n'; } } } int32_t main(){ clock_t tStart = clock(); #ifdef khos freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif std::ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int q = 1; #ifdef TESTCASES // cin >> q; #endif while(q--) { solution(); cout << '\n'; } cerr<<fixed<<setprecision(3)<<"\nTime Taken: "<<(double)(clock()- tStart)/CLOCKS_PER_SEC<<endl; }