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 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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