-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.cpp
More file actions
45 lines (37 loc) · 719 Bytes
/
Copy pathmain.cpp
File metadata and controls
45 lines (37 loc) · 719 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
// 找出数组中最小的k个数字
#include <vector>
#include <set>
#include <functional>
void GetLeastNumbers(const std::vector<int> &data, std::vector<int> &vec, int k)
{
std::multiset<int, std::greater<int> > set;
if (k < 1 || data.size() < k)
return;
for (auto value : data)
{
if (set.size() < k)
set.insert(value);
else
{
if (value < *set.begin())
{
set.erase(set.begin());
set.insert(value);
}
}
}
for (auto value : set)
{
vec.push_back(value);
}
}
std::vector<int> GetLeastNumbers_Solution(std::vector<int> input, int k) {
std::vector<int> vec;
GetLeastNumbers(input, vec, k);
return vec;
}
int main()
{
GetLeastNumbers_Solution({ 1,2,3,5, 7,3,2,1,0}, 4);
return 0;
}