小咪买东西----01分数规划+二分

题目链接

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 100010;
#define int long long
int a[N],b[N],c[N];
int n,k;
int check(int mid)
{
    for(int i=1;i<=n;i++)c[i]=b[i]-a[i]*mid;
    sort(c+1,c+n+1,greater<int>());
    //for(int i=1;i<=n;i++)cout<<c[i]<<" ";
    int res=0;
    for(int i=1;i<=k;i++)res+=c[i];
    return res>=0;
}
signed main()
{
    int T;
    cin>>T;
    while(T--)
    {
        cin>>n>>k;
        for(int i=1;i<=n;i++)cin>>a[i]>>b[i];
        int l=0,r=1e4;
        while(l<r)
        {
            int mid=l+r+1>>1;
            if(check(mid))l=mid;
            else r=mid-1;
        }
        cout<<r<<endl;
    }
}