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.util.Scanner;

public class Main {

    static int bubblesort(int A[],int N){
        int count = 0;
        for (int i = 0; i<N-1;i++){
            for (int j = 0; j<N-i-1;j++) {
                if (A[j] > A[j + 1]) {
                    int temp = A[j];
                    A[j] = A[j + 1];
                    A[j + 1] = temp;
                    count++;
                }
            }
        }
        return count;
    }

  static void printArray(int A[],int N){
        for (int i = 0; i<N;i++){
            System.out.print(A[i]+" ");
        }
        System.out.println();
    }

    public static void main(String[]args) {
        Scanner scanner = new Scanner(System.in);
        int count = 0;
        int N = scanner.nextInt();
        int A[] = new int[100];
        for (int i = 0; i<N;i++)
        {
            A[i] = scanner.nextInt();
        }
        count = bubblesort(A,N);
        printArray(A,N);
        System.out.println(count);
    }
}