2162. Cow Sorting

单点时限: 2.0 sec

内存限制: 256 MB

Farmer John’s N (1 ≤ N ≤ 10,000) cows are lined up to be milked in the evening. Each cow has a unique “grumpiness” level in the range 1…100,000. Since grumpy cows are more likely to damage FJ’s milking equipment, FJ would like to reorder the cows in line so they are lined up in increasing order of grumpiness. During this process, the places of any two cows (not necessarily adjacent) can be interchanged. Since grumpy cows are harder to move, it takes FJ a total of X+Y units of time to exchange two cows whose grumpiness levels are X and Y.

Please help FJ calculate the minimal time required to reorder the cows.

输入格式

Line 1: A single integer: N.

Lines 2..N+1: Each line contains a single integer: line i+1 describes the grumpiness of cow i.

输出格式

Line 1: A single line with the minimal time required to reorder the cows in increasing order of grumpiness.

样例

Input
3
2
3
1
Output
7

5 人解决,17 人已尝试。

5 份提交通过,共有 25 份提交。

8.4 EMB 奖励。

创建: 13 年,8 月前.

修改: 3 年,2 月前.

最后提交: 6 年,6 月前.

来源: USACO 2007 February Gold

题目标签