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: Accepted)

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

class Main {
    public static void main(String[] args) {
        // 標準入力の読み込み開始
        Scanner scanner = new Scanner(System.in);

        // 数列の長さ
        int n = scanner.nextInt();

        // 数列
        List<Integer> numList = new ArrayList<Integer>();
        for (int i = 0; i < n; i++) {
            numList.add(scanner.nextInt());
        }

        // 標準入力の読み込み終了
        scanner.close();

        // 処理実行
        
        int flag = 1; // 逆の隣接要素が存在する
        int c = 0; //カウンタ
        while (flag == 1){
            flag = 0;
            for(int j = n-1; j >= 1; j--){
            //for j が N-1 から 1 まで
                if(numList.get(j)<numList.get(j-1)){
                //if A[j] < A[j-1]
                    //A[j] と A[j-1] を交換
                   
                    numList.add(j-1,numList.get(j));
                    numList.remove(j+1);
                    
                    c++;
                    
                    flag = 1;
                }
            }
        }        
        
        for(int i =0; i<n; i++){
	System.out.print(numList.get(i));
	if(i < n-1){
	    System.out.print(" ");
	}
        }
        System.out.println();
        
        System.out.println(c);
    }
}