505 新国王游戏 思维 [代码源][namomo spring camp]每日一题div2

$你仔细观察这两个序列，在任意一个位置i以及i+1他们的位置相互交换的话会影响前面的值以及后面的值$
那么就只需考虑
$b_i\ast a_{i+1}+b_{i+1}>b_{i+1}\ast a_i+b_i$
就可以了

//acmer mxc
#include<bits/stdc++.h>
#define mst(s,x) memset(s,x,sizeof(s));
#define sr(x) scanf("%d",&x); 
#define sr2(a,b) scanf("%d%d",&a,&b); 
#define sr3(a,b,c) scanf("%d%d%d",&a,&b,&c); 
#define f(i,a,n) for(int i=a;i<=n;i++)
#define sc(x) cout<<#x<<" : "<<x<<endl;
#define hh cout<<endl;
//#define int __int128
#define pii pair<int,int>
#define pb(x) push_back(x)
#define mk(a,b) make_pair(a,b)
#define ls(x) x<<1
#define rs(x) x<<1|1
#define fi first
#define se second
#define ll __int128
#define inf 0x3f3f3f3f
using namespace std;
inline ll read()
{
	ll x=0,w=1; char c=getchar();
	while(c<'0'||c>'9') {if(c=='-') w=-1; c=getchar();}
	while(c<='9'&&c>='0') x=(x<<1)+(x<<3)+c-'0',c=getchar();
	return w==1?x:-x;
}
inline void write(ll x)
{
	if(x>=10) write(x/10);
	putchar(x%10+'0');
}
//------------------------------------------------
#define int long long
// #define int __int128
#define LL long long
#define dd double
const int N=1e6+5;
const int mod=1000000007;
int n;
struct node
{
	int x,y;
}nn[N];
bool cmp(node a,node b)
{
	return a.y*b.x+b.y>a.x*b.y+a.y;
}
int hz[N];
inline void solve()
{
	scanf("%lld",&n);
	for(int i=1;i<=n;i++)
	{
		int x,y;
		scanf("%lld%lld",&x,&y);
		nn[i]={x,y};
	}
	sort(nn+1,nn+1+n,cmp);
	for(int i=n;i>=1;i--)
	{
		if(i==n)
		{
			hz[i]=nn[i].x;
			continue;
		}
		hz[i]=hz[i+1]*nn[i].x%mod;
	}
	LL ans=0;
	hz[n+1]=1;
	for(int i=1;i<=n;i++)
	{
		ans=(ans+nn[i].y*hz[i+1]%mod)%mod;
	}
	cout<<ans<<endl;
}

//------------------------------------------------
signed main()
{
	clock_t c1=clock();
#ifdef LOCAL
    freopen("in.in","r",stdin);
    freopen("out.out","w",stdout);
#endif
//==================================
    int T=1;
	// cin>>T;
	for(int i=1;i<=T;i++)
	{
		solve();
	}
//==================================
end:
    cerr<<endl<< "Time used:" << clock() - c1 << endl;
	return 0;
}