CF 248B 前缀和

操作1 l r 是原序列l-r的和
操作2 l r 是从小到大排序后的l-r的和

input
6
6 4 2 7 2 7
3
2 3 6
1 3 4
1 1 6
output
24
9
28

 # include <iostream>
 # include <cstdio>
 # include <cstring>
 # include <algorithm>
 # include <string>
 # include <cmath>
 # include <queue>
 # include <list>
 # define LL long long
 using namespace std ;

 LL a[] ;
 LL b[] ;

 LL a_sum[] ;
 LL b_sum[] ;

 int main()
 {
     //freopen("in.txt","r",stdin) ;
     int n , m ;
     while(scanf("%d" , &n) != EOF)
     {
         int i ;
         for (i =  ; i < n ; i++)
         {
             scanf("%I64d" , &a[i]) ;
             b[i] = a[i] ;
         }
         sort(b , b+n) ;
         a_sum[] = b_sum[] ;
         for (i =  ; i <= n ; i++)
         {
             a_sum[i] = a_sum[i-] + a[i-] ;
             b_sum[i] = b_sum[i-] + b[i-] ;
         }
         scanf("%d" , &m) ;
         while(m--)
         {
             int op , l , r ;
             scanf("%d%d%d" , &op , &l , &r) ;
             if (op == )
                 printf("%I64d\n" , a_sum[r]-a_sum[l-]) ;
             else
                 printf("%I64d\n" , b_sum[r]-b_sum[l-]) ;
         }
     }
     return ;
 }