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

1、主要是考点是输入，怎么输入 这两行数字

#include <iostream>
#include <vector>
#include<algorithm>

using namespace std;

int main()
{
    int numCnt = 0;
    int minNum = 0;
    while (cin >> numCnt >> minNum) {  // 输入第一行的两个数字
        vector<int> v2;
        int num = 0;
        for (int i = 0; i < numCnt; i++) {  // 以第一行的第一个数字为条件输入第二行数字
            cin >> num;
            v2.push_back(num);
        }
        sort(v2.begin(), v2.end());  // 排序
        for (auto it = 0; it < minNum; it++) {  // 输出前k个小的数字
            cout << v2[it] << " ";
        }
        cout << endl;
    }
    return 0;
}

F2:
#include <iostream>
#include <set>

using namespace std;

int main()
{
    int numCnt = 0;
    int minNum = 0;
    multiset<int> v3;
    while (cin >> numCnt >> minNum) {
        int num = 0;
        for (int i = 0; i < numCnt; i++) {
            cin >> num;
            v3.insert(num);
        }

        int i = 0;
        for (auto it = v3.begin(); it != v3.end(); it++, i++) {
            if (i < minNum) {
                cout << *it << " ";
            }
        }
        cout << endl;
        v3.clear();
    }
    return 0;
}