| Time Limit | $2$ 秒/Second(s) | Memory Limit | $512$ 兆字节/Megabyte(s) |
| 提交总数 | $26$ | 正确数量 | $6$ | "
| 裁判形式 | 标准裁判/Standard Judge | 我的状态 | 尚未尝试 |
| 难度 | 分类标签 |
There are N bugs to be repaired and some engineers whose abilities are roughly equal. And an engineer can repair a bug per day. Each bug has a deadline A[i].
Question: How many engineers can repair all bugs before those deadlines at least?
1<=n<= 1e6. 1<=a[i] <=1e9
There are multiply test cases.
In each case, the first line is an integer N , indicates the number of bugs. The next line is n integers indicates the deadlines of those bugs.
There are one number indicates the answer to the question in a line for each case.
4
1 2 3 4
1
| 本题记录 | 用 户（点击查看用户） | 运行号（点击购买题解） | 时 间 |
|---|---|---|---|
| 算法最快[$754 $ms] | sqz4567 | 896087 | 2022-08-05 16:25:39 |
| 内存最少[$0 $KB] | 淡意的温柔 | 588180 | 2020-05-28 11:01:37 |
| 第一AC | 时涛涛@计算机科学与技术162 | 84310 | 2017-04-26 21:30:48 |
| 第一挑战 | AOJ大管家 | 84164 | 2017-04-26 12:51:59 |
| 竞赛编号 | 竞赛名称 | 竞赛时间 | 访问比赛 |
|---|---|---|---|
| 1080 | 2017ACM集训赛 | 2017-04-26 12:00:00 | 请登录 |