class Solution { public: vector<int> GetLeastNumbers_Solution(vector<int> input, int k) { if (k > input.size()) return {}; vector<int> res; priority_queue<int> pq; // 大根堆 for (int i = 0; i < input.size(); i++) { pq.push(in...
