Codeforces 869B Kuriyama Mirai's Stones - Walkthrough

You have one array and two query types. For type $1$ queries, you use the original array. For type $2$ queries, you use the sorted (ascending) array. Build prefix sums for both: $pref1$ on the original, $pref2$ on the sorted copy.

Each query gives you $l$ and $r$. The answer is $pref[r] - pref[l-1]$ using the appropriate prefix array. Sort once at the start in $O(n \log n)$, then answer each query in $O(1)$.