Ahmed_Negm

Untitled

Apr 20th, 2022
112
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.13 KB | None | 0 0
  1. #include<iostream>
  2. #include<cmath>
  3. #include<iomanip>
  4. #include<algorithm>
  5. #include<cstdlib>
  6. #include<cstring>
  7. #include<vector>
  8. #include<utility>
  9.  
  10. #define ll long long
  11. #define sz(x) int(x.size())
  12. #define all(x) x.begin(),x.end()
  13. #define rall(s)  s.rbegin(), s.rend()
  14. #define ceill(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
  15. using namespace std;
  16.  
  17. void Fast_IO(){
  18.     ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  19.     #ifndef ONLINE_JUDGE
  20.         freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
  21.     #endif
  22. }
  23.  
  24.  
  25.  
  26.  
  27.  
  28. void solve(){
  29.     ll n; cin>>n;
  30.     vector<ll>v(n+1);
  31.     vector<ll>v2;
  32.     vector<ll>prefix1(n+1);
  33.     vector<ll>prefix2(n+1);
  34.     for(int i=1; i<=n; i++) cin>>v[i];
  35.     v2 = v;
  36.     sort(all(v2));
  37.     for(int i=1; i<=n; i++){
  38.         prefix1[i] = prefix1[i-1]+v[i];
  39.         prefix2[i] = prefix2[i-1]+v2[i];
  40.     }
  41.     // for(int i=0; i<n; i++) cout<<v2[i]<<' ';
  42.     int q; cin>>q;
  43.     while(q--){
  44.         int x,l,r; cin>>x>>l>>r;
  45.         if(x==1) cout<<prefix1[r]-prefix1[l-1];
  46.         else cout<<prefix2[r]-prefix2[l-1];
  47.         cout<<'\n';
  48.     }
  49.  
  50. }
  51.  
  52. int main(){
  53.     Fast_IO();
  54. int t =1;
  55. //cin>>t;
  56. while(t--){
  57. solve();
  58. }
  59. return 0;
  60. }  
Advertisement
Add Comment
Please, Sign In to add comment