一百万数据求Top K

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define N 1005
#define mod 1000000007
#define INF 0x3f3f3f3f

const double eps=1e-8;
const double pi=acos(-1.0);


vector<int>* solve(int num[], int len, int topK)
{
    priority_queue<int, vector<int>, greater<int> > pq; // topK个元素的小顶堆
    for(int i=0; i<topK; i++){
        pq.push(num[i]);
    }

    for(int i=topK; i<len; i++){
        if(num[i]>pq.top()){
            pq.pop();
            pq.push(num[i]);
        }
    }

    vector<int> *ans = NULL;
    ans = new vector<int> ();
    while(!pq.empty()){
        ans->push_back(pq.top());
        pq.pop();
    }
    return ans;
}

int main()
{
    int num[]={1,3,2,6,9,6};
    vector<int> *ans = solve(num, 6, 3);
    for(int i=0;i<ans->size();i++)
        cout<<(*ans)[i]<<endl;
    delete ans;
    return 0;
}