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[100010] ;
LL b[100010] ;

LL a_sum[100010] ;
LL b_sum[100010] ;

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