Kuriyama Mirai_s Stones.cpp

// https://codeforces.com/contest/433/problem/B
#include <bits/stdc++.h>

using namespace std;

#define fi          first
#define se          second
#define pb          push_back
#define mp          make_pair
#define all(x)      x.begin(), x.end()
#define ll          long long
#define pll         pair<long, long>
#define vll         vector<long long>
#define inf         1e18
#define gcd(a, b)   __gcd(a, b)
#define range(a,b)  substr(a,b-a+1)
#define fori(a, n)  for (ll i = a; i < n; i++)
#define forj(a, n)  for (ll j = a; j < n; j++)
#define fork(a, n)  for (ll k = a; k < n; k++)
#define print(x)    for (auto i : x) {cout << i << " ";}
#define FIO         ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)

template <class T>
bool comp(T a, T b) {
    if (a < b)
        return true;
    return false;
}

int main()
{
    FIO;

    #ifndef ONLINE_JUDGE
    //remove this piece of code when this has to be submitted in kickstart, coding ninjas
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    //freopen is used to associate a file with stdin or stdout stream in C++
    #endif

    ll n, m;
    cin >> n;
    vll arr(n + 1), pre(n + 1), pres(n + 1);
    fori(1, n + 1)
        cin >> arr[i];
    fori(1, n + 1)
        pre[i] = arr[i] + pre[i - 1];
    sort(all(arr));
    fori(1, n + 1)
        pres[i] = arr[i] + pres[i - 1];
    cin >> m;
    fori(0, m) {
        ll t, l, r;
        cin >> t >> l >> r;
        if (t == 1)
            cout << pre[r] - pre[l - 1];
        else
            cout << pres[r] - pres[l - 1];
        cout << "\n";
    }

    return 0;
}