G-Game Strategy_“Shopee杯” e起来编程暨武汉大学2020年大学生程序设计大赛决赛（重现赛）

时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld

题目描述

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$

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?

输入描述:

The 1st line contains an integer $n\ (1 \leqslant n \leqslant 100)$ .

The 2nd line contains n integers $a_1,...,a_n$ .

The 3rd line contains n integers $b_1,...,b_n$ .

The 4th line contains n integers $c_1,...,c_n$ .

$-10^8 \leqslant a_i,b_i,c_i \leqslant 10^8$

输出描述:

Output the final value.

示例1

输入

复制

输出

复制

-2

说明

In the case above,Alice will remove 1, Bob removes -5, and Cindy removes 3.