hdu多校（离散化+树状数组）

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
#include<set>
#define mem(a,x) memset(a,x,sizeof(a))
#define s1(x) scanf("%d",&x)
#define s2(x,y) scanf("%d%d",&x,&y)
#define s3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define s4(x,y,z,k) scanf("%d%d%d%d",&x,&y,&z,&k)
#define ff(a,n) for(int i = 0 ; i < n; i++) scanf("%d",a+i)
#define tp(x) printf("x = %d\n",x)
#define ansp(x) printf("%d\n",x)
#define ls 2*rt
#define rs 2*rt+1
#define lson ls,L,mid
#define rson rs,mid+1,R
#define ll long long
using namespace std;
typedef pair<int,int> pii;
const ll inf = 0x3f3f3f3f;

const int mx = 1e5+10;

int c[mx];
int n,x,y;
inline ll lowbit(int x){return x&(-x);}
inline ll ask(int x){ll res=0;while(x)res+=c[x],x-=lowbit(x);return res;}
inline void add(int x,int d){while(x<=n)c[x]+=d,x+=lowbit(x);}

struct no{
    int v,id;
}p[mx];

bool cmp1(no &a, no &b){
    return a.v<b.v;
}
bool cmp2(no &a, no &b){
    return a.id<b.id;
}
int main(){
    //int T=10;    scanf("%d",&T);
    //    freopen("F:\\in.txt","r",stdin);
    while(s3(n,x,y) != EOF){
    
        for(int i = 1; i <= n; i++){
            s1(p[i].v);
            p[i].id = i;    
        }
        sort(p+1,p+1+n,cmp1);
        int cnt = 1;
        int pre = p[1].v;
        p[1].v = 1; 
        for(int i = 2; i <= n; i++){
                if(p[i].v == pre)
                    p[i].v = p[i-1].v;
                else{
                    pre = p[i].v;
                    p[i].v = ++cnt;
                } 
        }
        sort(p+1,p+1+n,cmp2);
        
        mem(c,0);
        ll ans = 0;
        for(int i = 1; i <= n; i++){
            ans += ask(cnt) - ask(p[i].v);
            add(p[i].v,1);    
        }
        ans = ans * min(x,y);    
        cout<<ans<<endl;
    }


    return 0;
}