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 C# (judge verdict: Accepted)

using System;

namespace tst
{
    class Program
    {
        static void Main(string[] args)
        {
            //nは繰り返しの回数
            int n = int.Parse(Console.ReadLine());
            //input//5 3 2 4 1 //strをint配列に
            string str = Console.ReadLine();
            string[] dt_str = str.Split(' ');
            int[] dt = new int[n];
            for(int i=0; i<=n-1; i++)
            {
               dt[i] = int.Parse(dt_str[i]);
            }
            //int [] dt=[5,3,2,4,1}となってるはず
            //while>for>ifループの中でifが使われなくなった時、ループ抜けるようにするためflag使う
            bool flag = true;
            int alt = 0;
            int st = 1;
            int ct = 0;
            while (flag)
            {
                flag = false;
                for(int j=n-1; j>=st; j--)
                {
                    if (dt[j-1] > dt[j])
                    {
                        alt = dt[j];
                        dt[j] = dt[j - 1];
                        dt[j - 1] = alt;
                        flag = true;
                        ct += 1;
                    }
                }
                st += 1;
            }
            //結果の出力
            Console.Write(dt[0]);
            for(int i=1; i<=n-1; i++)
            {
                Console.Write(" " + dt[i]);
            }
            Console.WriteLine();
            Console.WriteLine(ct);
        }
    }
}