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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main{
	static int N;
	static int [] A;
	static int max;
	static int count;
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		N = Integer.parseInt(br.readLine());
		String [] temp = br.readLine().split(" ");
		max = temp.length;
		A = new int[max];
		for(int i=0;i < max;i++){
			A[i] = Integer.parseInt(temp[i]);
		}

		for(int i=0;i < max;i++){
			sort();
		}

		for(int i=0;i < max-1;i++){
			System.out.print(A[i]+" ");
		}
		System.out.println(A[max-1]);
		System.out.print(count);
	}

	public static void sort(){
		for(int i=max-1;i>0;i--){
			if(A[i] >= A[i-1]){
				continue;
			}
			else{
				int num = A[i];
				A[i] = A[i-1];
				A[i-1] = num;
				count++;
			}


		}
	}

}