SSORT - Silly Sort

no tags 

Your younger brother has an assignment and needs some help. His teacher gave him a sequence of numbers to be sorted in ascending order. During the sorting process, the places of two numbers can be interchanged. Each interchange has a cost, which is the sum of the two numbers involved.

You must write a program that determines the minimal cost to sort the sequence of numbers.


The input file contains several test cases. Each test case consists of two lines. The first line contains a single integer n (n>1), representing the number of items to be sorted. The second line contains n different integers (each positive and less than 1000), which are the numbers to be sorted.

The input is terminated by a zero on a line by itself.


For each test case, the output is a single line containing the test case number and the minimal cost of sorting the numbers in the test case.

Place a blank line after the output of each test case.


3 2 1
8 1 2 4
1 8 9 7 6
8 4 5 3 2 7

Case 1: 4

Case 2: 17

Case 3: 41

Case 4: 34

hide comments
priyanshul: 2019-01-22 14:33:12

There is no constraint on N, nice problem.

jcode777: 2018-08-24 23:26:34

@supriyanta Ditto dude. Silly Format.

supriyanta: 2018-08-23 15:37:54

Output format cost 1 wa. :(

pk845: 2018-07-11 06:38:20

+1 to setter!

imkiller: 2018-06-03 08:25:34

Tricky One

tushar8848: 2017-12-24 17:57:45

swap 1 & 6 first

Last edit: 2017-12-24 18:54:47
sidiq_ha: 2017-11-01 07:50:38

How to get 41 for the third case?

satya_jha123: 2015-09-19 21:28:39

Struggled for almost two days then finally got the concept .Cycle and its values.Quality problem.

Last edit: 2015-09-19 21:29:21
Martijn Muijsers: 2013-12-01 21:47:11

Awesome problem, compliments!

shivendra panicker: 2012-12-15 05:28:30

very good problem!!

Added by:Fudan University Problem Setters
Time limit:0.5s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: C99 ERL JS-RHINO NODEJS PERL6 VB.NET
Resource:ACM/ICPC World Final 2002 (unofficial testdata)