wa3个点求调

#include <bits/stdc++.h> 
using namespace std; 
typedef long long ll;
const ll MOD=1e9+7;
const ll maxn=5e5+5;
int n,m; 
ll P;
ll p[maxn];
vector<pair<ll,ll>> a[maxn];
ll x[maxn],l[maxn];
bool cmp(pair<ll,ll> X,pair<ll,ll> Y){
	return X.second*Y.first>Y.second*X.first;
} 
ll check(ll k){
	ll cnt=0;
	for(int i=1;i<=n;i++){
		ll sum=p[i];
		for(int j=0;j<(int)a[i].size();j++){
			pair<ll,ll> to=a[i][j];
			if(sum/to.first*to.second>=k){
				cnt++;
				sum-=sum/to.first*to.second;
			}
		}
	}
	return cnt;
}
ll solve(ll k){
	for(int i=1;i<=n;i++){
		ll sum=p[i];
		for(int j=0;j<(int)a[i].size();j++){
			pair<ll,ll> to=a[i][j];
			if(sum/to.first*to.second>=k){
				P-=sum/to.first*to.second;
				sum-=sum/to.first*to.second;
			}else break;
		}
	}
	return P;
}
int main() { 
	cin >> n >> m;
	for(int i=1;i<=n;i++){
		cin >> x[i] >> l[i];
		p[i]=x[i];
		for(int j=1;j<=l[i];j++){
			ll k;
			cin >> k;
			a[i].push_back((make_pair)(k,0));
			p[i]*=k;
		}
		P+=p[i];
		for(int j=1;j<=l[i];j++){
			ll k;
			cin >> k;
			a[i][j-1].second=k;
		}
		sort(a[i].begin(),a[i].end(),cmp);	
	}
	ll l=0,r=P+1;
	while(l+1<r){
		ll mid=(l+r)/2;
		if(check(mid)<m){
			r=mid;
		}else{
			l=mid;
		}
	//	cout << l << " " << r << endl;
	}
//	cout << l << " ";
	cout << solve(l);
	return 0; 
}