CF863B.Kayaking
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Vadim is really keen on travelling. Recently he heard about kayaking activity near his town and became very excited about it, so he joined a party of kayakers.
Now the party is ready to start its journey, but firstly they have to choose kayaks. There are 2⋅n people in the group (including Vadim), and they have exactly n−1 tandem kayaks (each of which, obviously, can carry two people) and 2 single kayaks. i -th person's weight is wi , and weight is an important matter in kayaking — if the difference between the weights of two people that sit in the same tandem kayak is too large, then it can crash. And, of course, people want to distribute their seats in kayaks in order to minimize the chances that kayaks will crash.
Formally, the instability of a single kayak is always 0 , and the instability of a tandem kayak is the absolute difference between weights of the people that are in this kayak. Instability of the whole journey is the total instability of all kayaks.
Help the party to determine minimum possible total instability!
输入格式
The first line contains one number n ( 2<=n<=50 ).
The second line contains 2⋅n integer numbers w1 , w2 , ..., w2n , where wi is weight of person i ( 1<=wi<=1000 ).
输出格式
Print minimum possible total instability.
输入输出样例
输入#1
2 1 2 3 4
输出#1
1
输入#2
4 1 3 4 6 3 4 100 200
输出#2
5