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.
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
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.
Name |
---|
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