Codeforces Round #248 (Div. 2) B. Kuriyama Mirai's Stones

题目简单描述就是求数组中[l,r]区间的和

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
using namespace std;

int main(){
    int n,m;
    cin >> n;
    vector<long long> v(n+,);
    for(int i=  ; i <= n ; ++ i) cin >> v[i];
    vector<long long> u(v.begin(),v.end());
    sort(u.begin(),u.end());
    for(int i = ; i <=n; ++ i){
        v[i]+=v[i-];
        u[i]+=u[i-];
    }
    cin >> m;
    for(int i = ; i < m; ++ i){
        int number,l,r;
        cin >> number >> l >> r;
        if(number == ) cout<<v[r]-v[l-]<<endl;
        else cout<<u[r]-u[l-]<<endl;
    }
}