博客
关于我
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 编译安装 window篇
查看>>
mysql 网络目录_联机目录数据库
查看>>
MySQL 聚簇索引&&二级索引&&辅助索引
查看>>
Mysql 脏页 脏读 脏数据
查看>>
mysql 自增id和UUID做主键性能分析,及最优方案
查看>>
Mysql 自定义函数
查看>>
mysql 行转列 列转行
查看>>
Mysql 表分区
查看>>
mysql 表的操作
查看>>
mysql 视图,视图更新删除
查看>>
MySQL 触发器
查看>>
mysql 让所有IP访问数据库
查看>>
mysql 记录的增删改查
查看>>
MySQL 设置数据库的隔离级别
查看>>
MySQL 证明为什么用limit时,offset很大会影响性能
查看>>
Mysql 语句操作索引SQL语句
查看>>
MySQL 误操作后数据恢复(update,delete忘加where条件)
查看>>
MySQL 调优/优化的 101 个建议!
查看>>
mysql 转义字符用法_MySql 转义字符的使用说明
查看>>