https://www.luogu.org/problemnew/show/P2345
开两个数组
t1用来计算坐标和
t2用来计算人数和
按v排序 可以消去max
(query2(c[i].x))*c[i].x:第i个人前面人数*第i个人的坐标
query1(c[i].x):第i个人前面人的坐标和
query1(maxn)-query1(c[i].x):第i个人后面人的坐标和
(i-query2(c[i].x))*c[i].x:第i个人后面人数*第i个人的坐标
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
using namespace std;
const int maxn=10000005;
typedef long long ll;
ll t1[maxn],t2[maxn];
ll ans,i,n;
struct node
{
int x,v;
}c[maxn];
ll lowbit(int i)
{
return i&(-i);
}
void update1(ll i,ll k)
{
while(i<=maxn)
{
t1[i]+=k;
i+=lowbit(i);
}
}
ll query1(ll i)
{
ll sum=0;
while(i>0)
{
sum+=t1[i];
i-=lowbit(i);
}
return sum;
}
void update2(ll i,ll k)
{
while(i<=maxn)
{
t2[i]+=k;
i+=lowbit(i);
}
}
ll query2(ll i)
{
ll sum=0;
while(i>0)
{
sum+=t2[i];
i-=lowbit(i);
}
return sum;
}
bool cmp(node a,node b)
{
if(a.v!=b.v)
return a.v<b.v;
return a.x<b.x;
}
int main()
{
scanf("%lld",&n);
for(int i=1;i<=n;i++)
scanf("%d%d",&c[i].v,&c[i].x);
sort(c+1,c+1+n,cmp);
for(int i=1;i<=n;i++)
{
update1(c[i].x,c[i].x);
update2(c[i].x,1);
ans+=((query2(c[i].x))*c[i].x-query1(c[i].x)+query1(maxn)-query1(c[i].x)-(i-query2(c[i].x))*c[i].x)*c[i].v;
}
printf("%lld\n",ans);
return 0;
}