ABC C玄学RE

#include<bits/stdc++.h>
using namespace std;

const int MAXN = 2 * 1e5 + 100;
int dis[MAXN],n;
struct Node{
    int id,num;
} a[MAXN];
int ans[MAXN];
bool cmp(Node x,Node y){
    if (x.num > y.num) return x.num > y.num;
    else return x.id < y.id;
}
int main(){
    cin>>n;
    for (int i = 1;i <= n;i++){
        cin>>a[i].num;
        a[i].id = i;
    }
    sort(a + 1,a + n + 1,cmp);
    for (int i = 2;i <= n;i++) dis[i] = dis[i - 1] + a[i - 1].num;
    int sm = 0;
    for (int i = 1;i <= n;i++){
        if (a[i].num == a[i - 1].num) sm++;
        else sm = 1;
        ans[a[i].id] = dis[i] - (sm - 1) * a[i].num;
    }
    for (int i = 1;i <= n;i++) cout<<ans[i]<<" ";
}