c++海量数据查找前10个最小的数__2018.06.02

1

#include <iostream>
#include <vector>
#include<queue>
#include<time.h>

using namespace std;
int main()
{
	srand(time(0));
	priority_queue<int> MyIntPriority_Queue;
	vector<int> MyVector;
	int i, j;
	MyVector.reserve(1000);
	for (i = 0; i < 1000; ++i)
	{
		j = rand() % 1000;
		MyVector.push_back(j);
		if (i < 10)
		{
			MyIntPriority_Queue.push(j);
		}
	}
	for (int i = 11; i < 1000; i++)
	{
		if (MyVector.at(i) < MyIntPriority_Queue.top())
		{
			MyIntPriority_Queue.pop();
			MyIntPriority_Queue.push(MyVector.at(i));
		}
	}
	for (int i = 0; i < 10; i++)
	{
		cout << MyIntPriority_Queue.top() << " ";
		MyIntPriority_Queue.pop();
	}
}