Problem:
Bubble Sort

Write a program of the Bubble Sort algorithm which sorts a sequence A in ascending order. The algorithm should be based on the following pseudocode:

BubbleSort(A)
1 for i = 0 to A.length-1
2 for j = A.length-1 downto i+1
3 if A[j] < A[j-1]
4 swap A[j] and A[j-1]

Note that, indices for array elements are based on 0-origin.

Your program should also print the number of swap operations defined in line 4 of the pseudocode.

Input

The first line of the input includes an integer N, the number of elements in the sequence.

In the second line, N elements of the sequence are given separated by spaces characters.

Output

The output consists of 2 lines.

In the first line, please print the sorted sequence. Two contiguous elements of the sequence should be separated by a space character.

In the second line, please print the number of swap operations.

Constraints

1 ≤ N ≤ 100

Sample Input 1

5
5 3 2 4 1

Sample Output 1

1 2 3 4 5
8

Sample Input 2

6
5 2 4 6 1 3

Sample Output 2

1 2 3 4 5 6
9

Solution in JAVA (judge verdict: WA: Presentation Error)

import java.io.*;

public class Main{
    public static void main(String[] args){
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        try{
            String num = reader.readLine();
            int n = Integer.parseInt(num);
            String line = reader.readLine();
            String[] splitline = line.split("\\s");
            int[] array = new int[splitline.length];
            for (int i=0;i<splitline.length;i++){
                array[i] = Integer.parseInt(splitline[i]);
            }
            int count=0;

            for(int i=0;i<array.length-1;i++){
                for(int j=array.length-1;j>i;j--){
                    if(array[j-1] > array[j]){
                        int tmp = array[j-1];
                        array[j-1] = array[j];
                        array[j] = tmp;
                        count++;
                    }
                }
            }
            for(int i=0;i<array.length;i++){
                System.out.printf("%d"+" ",array[i]);
            }
            System.out.println("\n"+count+"\n");

        }catch (IOException e){
                System.out.println(e);
        }
    }
}