how to solve this problem: given a n — numbers of players and their height h_i. You need to split to k teams that the incompatibility is minimal. Incompatibility is the sum of the mx(maximum height of team player)-h_i(height of other player)
Problem
how to solve this problem: given a n — numbers of players and their height h_i. You need to split to k teams that the incompatibility is minimal. Incompatibility is the sum of the mx(maximum height of team player)-h_i(height of other player)
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en1 | Pororo789 | 2019-01-30 11:54:29 | 306 | Initial revision for English translation | ||
ru3 | Pororo789 | 2019-01-30 10:42:11 | 8 | |||
ru2 | Pororo789 | 2019-01-30 10:41:22 | 41 | Мелкая правка: ' player)\n' -> ' player)\nn <= 10^5 \nk <= min(n,20)\nh_i <= 10^6\n' | ||
ru1 | Pororo789 | 2019-01-30 10:40:35 | 257 | Первая редакция (опубликовано) |