为啥这一题的二分答案，题解里面全是l<r，答案记录法l<=r为啥不行

#include<bits/stdc++.h>
using namespace std;
#define int long long
vector<int> a;
vector<int> b;

bool pp(int mid,int k,int n)
{int count=0;
	int sum=mid*mid;
	for(int i=0;i<n;i++)
	{
	
		if(sum<=a[i]*b[i])
		count+=(a[i]*b[i]/sum);
	}
	if(count<=k)
	return true;
	else
	return false;	
}
signed main()
{
	int n,k;
	cin>>n>>k;
	for(int i=0;i<n;i++)
	{
		int x,y;
		cin>>x>>y;
		a.push_back(x);
		b.push_back(y);
	}
	int l=1;
	int r=100000;
	int result=0;
	while(l<=r)
	{
		int mid=(l+r+1)/2;
		if(pp(mid,k,n))
		{
		result=mid;
			r=mid-1;
		}
		else
		{
		
		l=mid+1; 
		}
		
	}
	cout<<result;
	 

 }