CSES - Datatähti 2017 alku - Results
 Task: Järjestys Sender: YvMa^Na9 Submission time: 2016-10-05 18:18:07 +0300 Language: Java Status: READY Result: 0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.10 s1details
#20.14 s2details
#3--3details

### Code

```//import java.util.Scanner;
//import java.util.TreeMap;
//import java.util.Set;
import java.util.*;
//import java.util.Arrays;
//import java.util.ArrayList;
public class jarjestys2 {

public static void main (String[] args) {
//Jarjestys();

IO io = new IO();
//        Scanner scanner = new Scanner(System.in);
//       int a = scanner.nextInt();
int a = io.nextInt();//scanner.nextInt();
//int y;
int[] nums = new int[a];
int[] turns = new int[a];
for (int j = 0; j < a; j++) {
nums[j] = io.nextInt();//scanner.nextInt();
turns[j] = j+1;
}
//System.out.println(a*4);
io.println(a*4);
for (int i = 0; i < a; i++) {
for (int j = i; j < a; j++) {//optim
if (nums[i] > nums[j]) {
turns[j]--;
//System.out.println("J: " + j);
//System.out.println(turns[j]);
}
}
}
//create map from nums -> turns
//sort based on nums
//print largest num 1.
//print turns[indexof(largestnum)]
//print curr arr length
//curr arr length--
//print arr length
//print posoflargestnum (index)
TreeMap tm = new TreeMap(Collections.reverseOrder());
for (int i = 0; i < nums.length; i++) {
tm.put(nums[i], turns[i]);
}
Set set = tm.entrySet();
Iterator i = set.iterator();
// Display elements
while(i.hasNext()) {
Map.Entry me = (Map.Entry)i.next();
int temp = (int) me.getValue();
//System.out.println("Keyvalue: " + me.getKey());
//System.out.print(temp + " ");
//System.out.print(a-- + " ");
//System.out.print(a + " ");
//System.out.print(temp - 1 + " ");
io.print(temp + " ");
io.print(a-- + " ");
io.print(a + " ");
io.print(temp - 1 + " ");
}
}

}
```

### Test details

#### Test 1

Group: 1

Verdict:

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

correct output
32
10 10 9 10 9 8 7 9 4 2 1 4 5 2...

user output
(empty)

#### Test 2

Group: 2

Verdict:

input
1000
650 716 982 41 133 1000 876 92...

correct output
3984
207 207 206 207 128 127 126 12...

user output
(empty)

#### Test 3

Group: 3

Verdict:

input
100000
94703 47808 62366 31885 7091 8...

correct output
399956
98676 98676 98675 98676 62994 ...

user output
(empty)