题解 | #输入n个整数，输出其中最小的k个#

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        scanner.useDelimiter("\n");

        while (scanner.hasNext()) {
            String[] S = scanner.next().split(" ");
            int[] original = new int[Integer.parseInt(S[0])];
            int K = Integer.parseInt(S[1]);
            String[] T = scanner.next().split(" ");
            for (int i = 0; i < original.length; i++) {
                original[i] = Integer.parseInt(T[i]);
            }
            guibing(original, 0, original.length-1);
            for (int i = 0; i < K; i++) {
                System.out.print(original[i]+" ");
            }
        }
    }

    public static void guibing(int[] original, int left, int right) {
        if (left>=right) return;
        int mid = left+((right-left)>>1);
        guibing(original, left, mid);
        guibing(original, mid+1, right);
        merge5(original, left, mid, right);
    }

    public static void merge5(int[] original, int left, int mid, int right) {
        int[] copy = new int[original.length];
        System.arraycopy(original, left, copy, left, right-left+1);

        int k = left, i=left,j=mid+1;
        while (k<=right) {
            if (i>mid) {
                original[k++] = copy[j++];
            } else if (j>right) {
                original[k++] = copy[i++];
            } else if (copy[i]>copy[j]) {
                original[k++] = copy[j++];
            } else {
                original[k++] = copy[i++];
            }
        }
    }
}