题解 | n个数里最小的k个

#include <bits/stdc++.h>
using namespace std;

class Solution {
public:
    vector<int> solve(vector<int>& nums, int k) {
        // 对数组排序
        sort(nums.begin(), nums.end());
        
        // 返回前k个元素
        return vector<int>(nums.begin(), nums.begin() + k);
    }
};

int main() {
    string line;
    getline(cin, line);
    
    // 解析输入
    stringstream ss(line);
    vector<int> nums;
    int num;
    while (ss >> num) {
        nums.push_back(num);
    }
    
    // 获取k值并从数组中移除
    int k = nums.back();
    nums.pop_back();
    
    Solution solution;
    vector<int> result = solution.solve(nums, k);
    
    // 输出结果
    for (int i = 0; i < k; i++) {
        cout << result[i];
        if (i < k - 1) cout << " ";
    }
    cout << endl;
    
    return 0;
}

import java.util.*;

public class Main {
    static class Solution {
        public int[] solve(int[] nums, int k) {
            // 对数组排序
            Arrays.sort(nums);
            
            // 返回前k个元素
            return Arrays.copyOf(nums, k);
        }
    }
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String[] input = sc.nextLine().split(" ");
        
        // 解析输入
        int[] nums = new int[input.length - 1];
        for (int i = 0; i < input.length - 1; i++) {
            nums[i] = Integer.parseInt(input[i]);
        }
        
        // 获取k值
        int k = Integer.parseInt(input[input.length - 1]);
        
        Solution solution = new Solution();
        int[] result = solution.solve(nums, k);
        
        // 输出结果
        for (int i = 0; i < k; i++) {
            System.out.print(result[i]);
            if (i < k - 1) System.out.print(" ");
        }
        System.out.println();
        
        sc.close();
    }
}

class Solution:
    def solve(self, nums, k):
        # 对数组排序
        nums.sort()
        # 返回前k个元素
        return nums[:k]

# 读取输入
nums = list(map(int, input().split()))
# 获取k值并从数组中移除
k = nums.pop()

solution = Solution()
result = solution.solve(nums, k)

# 输出结果
print(" ".join(map(str, result)))