基本看这个大佬思路过的:
https://blog.csdn.net/Jaihk662/article/details/79688225
#include<bits/stdc++.h>
using namespace std;
#define maxn 100005
long long tree[maxn];
long long pos_at_t2[maxn];
struct Node{
double x,v;
long long index;
}t1[maxn],t2[maxn];
long long lowbit(long long x)
{
return x&(-x);
}
void add(long long pos,long long k)
{
for(long long i=pos;i<maxn;i+=lowbit(i))
{
tree[i]+=k;
}
}
long long sum(long long k)
{
long long ret=0;
for(long long i=k;i;i-=lowbit(i)) {
ret+=tree[i];
}
return ret;
}
bool cmp(Node A,Node B) {
return fabs(A.x*B.v)<fabs(A.v*B.x);
}
int main()
{
long long n;
double m;
while(~scanf("%lld%lf",&n,&m)) {
m+= 1e-6;
memset(tree,0,sizeof(tree));
for(long long i=1;i<=n;i++)
{
scanf("%lf%lf",&t1[i].x,&t1[i].v);
t1[i].index=t2[i].index=i;
t1[i].v+=m;
t2[i].v=t1[i].v-2*m;
t2[i].x=t1[i].x;
}
sort(t1+1,t1+n+1,cmp);
sort(t2+1,t2+n+1,cmp);
for(long long i=1;i<=n;i++) pos_at_t2[t2[i].index]=i;
long long ans=0;
for(long long i=1;i<=n;i++)
{
long long before=sum(pos_at_t2[t1[i].index]);
ans+=(pos_at_t2[t1[i].index]-1-before+i-1-before);
add(pos_at_t2[t1[i].index],1);
}
cout<<ans/2<<endl;
}
}