博客
关于我
2019ICPC 沈阳重现 L-Flowers(二分)
阅读量:390 次
发布时间:2019-03-05

本文共 1012 字,大约阅读时间需要 3 分钟。

7-7 L-Flowers

Recently Jack becomes much more romantic. He would like to prepare several bunches of flowers.

Each bunch of flowers must have exactly M flowers. As Jack does not want to be boring, he hopes that flowers in the same bunch are all different species. Now there are N species of flowers in the flower shop, and the number of the i-th species of flower is a​i. Now Jack would like to know how many bunches of flowers he can prepare at most.

(Flowers are used to propose.)

Sample Input
1
5 3
1 1 1 2 1

Sample Output

2
思路:二分答案,看一下共x朵花,每朵花m个不同的花组成能不能满足就行了。

#include
using namespace std;typedef long long ll;const int maxn=3e5+1; int T,n;ll k,a[maxn];bool check(ll x){ ll sum=0; for(int i=1;i<=n;++i) sum+=min(a[i],x); return sum>=x*k;}int main(){ scanf("%d",&T); while(T--) { ll sum=0; scanf("%d %lld",&n,&k); for(int i=1;i<=n;++i) scanf("%lld",&a[i]),sum+=a[i]; ll l=0,r=sum,mid; while(l<=r) { mid=(l+r)>>1; if(check(mid)) l=mid+1; else r=mid-1; } printf("%lld\n",r); } }

转载地址:http://thewz.baihongyu.com/

你可能感兴趣的文章
MySQL在渗透测试中的应用
查看>>
Mysql在离线安装时启动失败:mysql服务无法启动,服务没有报告任何错误
查看>>
Mysql在离线安装时提示:error: Found option without preceding group in config file
查看>>
MySQL基于SSL的主从复制
查看>>
Mysql基本操作
查看>>
mysql基本操作
查看>>
mysql基础
查看>>
mysql基础---mysql查询机制
查看>>
MySQL基础5
查看>>
MySQL基础day07_mysql集群实例-MySQL 5.6
查看>>
Mysql基础命令 —— 数据库、数据表操作
查看>>
Mysql基础命令 —— 系统操作命令
查看>>
MySQL基础学习总结
查看>>
mysql基础教程三 —常见函数
查看>>
mysql基础教程二
查看>>
mysql基础教程四 --连接查询
查看>>
MySQL基础知识:创建MySQL数据库和表
查看>>
MySQL基础系列—SQL分类之一
查看>>
MySQL处理千万级数据分页查询的优化方案
查看>>
mysql备份
查看>>