二分

最新推荐文章于 2025-03-12 21:00:24 发布

XerxesSimon

最新推荐文章于 2025-03-12 21:00:24 发布

阅读量282

点赞数

CC 4.0 BY-SA版权

分类专栏：经典算法

本文链接：https://blog.youkuaiyun.com/XerxesSimon/article/details/51443513

经典算法专栏收录该内容

12 篇文章

订阅专栏

https://www.bnuoj.com/bnuoj/problem_show.php?pid=49103

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <math.h>
#include <algorithm>
using namespace std;
#define ls 2*i
#define rs 2*i+1
#define up(i,x,y) for(i=x;i<=y;i++)
#define down(i,x,y) for(i=x;i>=y;i--)
#define mem(a,x) memset(a,x,sizeof(a))
#define w(a) while(a)
#define LL long long
const double pi = acos(-1.0);
#define N 1005
#define mod 19999997
const int INF = 0x3f3f3f3f;
#define exp 1e-8

LL n,m;
LL a[N],b[N],c[N];

LL bin(LL x)
{
    LL i,j,k,ans = 0;
    up(i,0,n-1)
    {
        c[i] = a[i]+b[i]*x;
    }
    sort(c,c+n);
    up(i,0,x-1)
    ans+=c[i];
    return ans<=m;
}

int main()
{
    LL i,j,k;
    w(~scanf("%lld%lld",&n,&m))
    {
        up(i,0,n-1)
        scanf("%lld",&a[i]);
        up(i,0,n-1)
        scanf("%lld",&b[i]);
        LL l=0,r = n,flag = 0;
        while(l<r)
        {
            LL mid = (l+r+1)/2;
            if(bin(mid))
                l=mid;
            else
                r=mid-1;
        }
        printf("%lld\n",l);
    }

    return 0;
}

http://blog.youkuaiyun.com/sr19930829/article/category/2399551
http://doc.okbase.net/cc_again/archive/71796.html
http://blog.youkuaiyun.com/My_ACM_Dream/article/category/3088157