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

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    int n, k;
    while (cin >> n >> k) {
        vector<int> nums(n);
        for (int i = 0; i < n; i++) {
            cin >> nums[i];
        }
        
        // 排序
        sort(nums.begin(), nums.end());
        
        // 输出前k个数
        for (int i = 0; i < k; i++) {
            cout << nums[i];
            if (i != k - 1) cout << " ";
        }
        cout << endl;
    }
    return 0;
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNext()) {
            int n = sc.nextInt();
            int k = sc.nextInt();
            
            int[] nums = new int[n];
            for (int i = 0; i < n; i++) {
                nums[i] = sc.nextInt();
            }
            
            // 排序
            Arrays.sort(nums);
            
            // 输出前k个数
            for (int i = 0; i < k; i++) {
                System.out.print(nums[i]);
                if (i != k - 1) {
                    System.out.print(" ");
                }
            }
            System.out.println();
        }
    }
}

while True:
    try:
        # 读取输入
        n, k = map(int, input().split())
        nums = list(map(int, input().split()))
        
        # 排序
        nums.sort()
        
        # 输出前k个数
        print(" ".join(map(str, nums[:k])))
        
    except EOFError:
        break