提交结果

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 10;
typedef long long ll;
ll n, p, a[MAXN], b[MAXN], z[MAXN];

bool check(ll x) {
	ll tot = 0;
	for (int i = 1; i <= n; i ++) {
		if (x > z[i]) tot += a[i] * z[i] + b[i] * (x - z[i]);
		else tot += a[i] * x; 
	}
	return tot >= p;
}

int main() {
	scanf("%lld%lld", &n, &p);
	for (int i = 1; i <= n; i ++) scanf("%lld%lld%lld", &z[i], &a[i], &b[i]);
	int l = 0, r = 1e12;
	while (l <= r) {
		ll mid = (l + r) / 2;
		if (check(mid)) r = mid - 1;
		else l = mid + 1;
	}
	printf("%d", l);
	return 0;
}