Capacity of an aircraft is K, you have N people with weights Wi. Find minimum number of air-crafts to transport all these people.
n <= 10^5 and k <= 10^9
How to approach this problem.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 151 |
9 | maroonrk | 151 |
Capacity of an aircraft is K, you have N people with weights Wi. Find minimum number of air-crafts to transport all these people.
n <= 10^5 and k <= 10^9
How to approach this problem.
Название |
---|
I think this problem is worth 1 million dollars.
It is a variation of the NP-complete Bin Packing problem.
Thanks!
As long as $$$K \geq \max{W_i}$$$ you can use one aircraft and then come back for more people