PTA 7-21 冒泡排序-JAVA实现

import java.util.Scanner;
public class Main {
    public static void main (String[] args)
    {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int k = scan.nextInt();
        int[] a = new int[100];
        for(int i=0;i<n;i++)
        {
            a[i]= scan.nextInt();
        }
        for(int i=0;i<k;i++)
        {
            for(int j=0;j<n-i-1;j++)
                if(a[j]>a[j+1])
                {
                    int temp;
                    temp=a[j+1];
                    a[j+1]=a[j];
                    a[j]=temp;
                }
        }

        for (int i=0;i<n;i++)
        {
            System.out.print(a[i]);
            if (i!=n-1)
                System.out.print(' ');
        }
    }
}