/* 初步想法,维护一个小根堆,也就是优先队列 */ #include <bits/stdc++.h> class Solution { public: vector<int> GetLeastNumbers_Solution(vector<int> input, int k) { priority_queue<int, vector<int>, greater<int>> ss; vector<int> s; for(int i = 0;i < input.size(); i++){ ss.push(i...