class Solution { long long cnt; void merge(vector<long long="">& t, int b, int mid, int e){ if(b >= e) return; vector<long long=""> L(t.begin()+b, t.begin()+mid+1); vector<long long=""> R(t.begin()+mid+1, t.begin()+e+1); int i = 0; int j = 0; in...