Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include<cmath>
- #include<iomanip>
- #include<algorithm>
- #include<cstdlib>
- #include<cstring>
- #include<vector>
- #include<utility>
- #define ll long long
- #define sz(x) int(x.size())
- #define all(x) x.begin(),x.end()
- #define rall(s) s.rbegin(), s.rend()
- #define ceill(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
- using namespace std;
- void Fast_IO(){
- ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
- #ifndef ONLINE_JUDGE
- freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
- #endif
- }
- void solve(){
- ll n; cin>>n;
- vector<ll>v(n+1);
- vector<ll>v2;
- vector<ll>prefix1(n+1);
- vector<ll>prefix2(n+1);
- for(int i=1; i<=n; i++) cin>>v[i];
- v2 = v;
- sort(all(v2));
- for(int i=1; i<=n; i++){
- prefix1[i] = prefix1[i-1]+v[i];
- prefix2[i] = prefix2[i-1]+v2[i];
- }
- // for(int i=0; i<n; i++) cout<<v2[i]<<' ';
- int q; cin>>q;
- while(q--){
- int x,l,r; cin>>x>>l>>r;
- if(x==1) cout<<prefix1[r]-prefix1[l-1];
- else cout<<prefix2[r]-prefix2[l-1];
- cout<<'\n';
- }
- }
- int main(){
- Fast_IO();
- int t =1;
- //cin>>t;
- while(t--){
- solve();
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment