WA on #20,#38,求条或hack

#include<bits/stdc++.h>
#define ll long long 
using namespace std;
ll n,m,a,b,c,ke[500010],bzr,bk[500010],ans,l,r,mid;
bool check(){
	ll sum=bzr;
	for(ll i=1;i<=m;i++){
		ll num=mid-ke[i];
		if(bk[i]<num) return false;
		sum-=num;
		if(sum<mid) return false;
	}return true;
}
int main(){
	cin>>n>>m;
	for(ll i=1;i<=n;i++){
		cin>>a>>b>>c;
		ke[a]+=b;
		if(c) bk[a]++,ke[a]--,bzr++;
	}l=0,r=bzr;
	while(l<=r){
		mid=(l+r)/2;
		if(check()) ans=mid,l=mid+1;
		else r=mid-1;
	}cout<<ans;
	return 0;
}