n=int(input())
costs=list(map(int,input().split()))
cum=[costs[0]]
for i in range(1,n):
cum.append(costs[i]+cum[i-1])
costs.sort()
cumsort=[costs[0]]
for i in range(1,n):
cumsort.append(costs[i]+cumsort[i-1])
m=int(input())
arr=[]
for i in range(m):
arr.append(list(map(int,input().split())))
for i in arr:
a=i[0]
b=i[1]-1
c=i[2]-1
if a==1:
if b==0 : print(cum[c])
else: print(cum[c]-cum[b-1])
else:
if b==0:print(cumsort[c])
else:print(cumsort[c]-cumsort[b-1])
#include <iostream>
#include <algorithm>
using namespace std;
long long a[100001], a2[100001];
void f1(int l, int r) {
cout << a[r] - a[l - 1] << endl;
}
void f2(int l, int r) {
cout << a2[r] - a2[l - 1] << endl;
}
int main()
{
int t, n;
cin >> n;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
a[i]= a2[i] = x;
}
sort(a2 + 1, a2 + n + 1);
for (int i = 1; i <= n; i++) {
a[i] += a[i - 1];
a2[i] += a2[i - 1];
}
cin >> t;
for (int i = 1; i <= t; i++) {
int type, l, r;
cin >> type >> l >> r;
if (type == 1)
f1(l, r);
else f2(l, r);
}
}
1584B - Coloring Rectangles | 1562B - Scenes From a Memory |
1521A - Nastia and Nearly Good Numbers | 208. Implement Trie |
1605B - Reverse Sort | 1607C - Minimum Extraction |
1604B - XOR Specia-LIS-t | 1606B - Update Files |
1598B - Groups | 1602B - Divine Array |
1594B - Special Numbers | 1614A - Divan and a Store |
2085. Count Common Words With One Occurrence | 2089. Find Target Indices After Sorting Array |
2090. K Radius Subarray Averages | 2091. Removing Minimum and Maximum From Array |
6. Zigzag Conversion | 1612B - Special Permutation |
1481. Least Number of Unique Integers after K Removals | 1035. Uncrossed Lines |
328. Odd Even Linked List | 1219. Path with Maximum Gold |
1268. Search Suggestions System | 841. Keys and Rooms |
152. Maximum Product Subarray | 337. House Robber III |
869. Reordered Power of 2 | 1593C - Save More Mice |
1217. Minimum Cost to Move Chips to The Same Position | 347. Top K Frequent Elements |