x+y+z Alice wants to maximize the value, Bob wants to minimize the value, and Cindy wants to make the value be close to zero as possible. Cindy will choose the largest one if there are more than one answers.Everyone is smart enough, so that they will take the best strategy, what will be the final value?
Alice, Bob and Cindy are playing an interesting game, each of them has an array of n integers. Each of them will remove an integer of his/her anrry in his/her turn, Alice plays first, Bob second, finally Cindy. In the end, everyone will have only one integer, Alice has x, Bob has y, and Cindy has z. And they will compute the value: x+y+z x+y+z x+y+z Alice wants to maximize the value, Bob wants to minimize the value, and Cindy wants to make the value be close to zero as possible. Cindy will choose the largest one if there are more than one answers. Everyone is smart enough, so that they will take the best strategy, what will be the final value?
（图片来源网络，侵删）
