2025年3月13日做

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 100010;
int n, k;
int chang[N];
int kuan[N];
bool  panduan(int b) {
    int big;
    int kuanshu = 0;
    int zuo = 0;
    int you = 0;
    for (int i = 1; i <= n; i++)
    {
        zuo = chang[i] / b;
        you = kuan[i] / b;

        kuanshu += zuo*you;
    }
    if (kuanshu >= k)
        return true;
    else return false;
}
int main()
{
    scanf_s("%d%d", &n, &k);
    for (int i = 1; i <= n; i++)
    {
        scanf_s("%d", &chang[i]);
        scanf_s("%d", &kuan[i]);
    }
    int l = 1; int r = 10;
    int mid;
    while (l < r)
    {
         mid = (l + r+1) / 2;
         if (panduan(mid))l = mid;
         else  r = mid - 1;
    }
    printf("%d", r);
    return 0;
}