优化递归算法在该题的时间损耗

#include<iostream>
#include<cstdlib>
using namespace std;
void SwAp(int &a,int &b){
    int tmp=a;
    a=b;
    b=tmp;
}
int FindKthLargest(int *num,int k,int left,int right){
    int base=num[left];//基准数
    int L=left,R=right;
    while(1){
        while((left<=right)&&(base<=num[left])) left++;
        while((left<right)&&base>num[right]) right--;
        if(left<right){
            SwAp(num[left],num[right]);
        }else break;
    }
    SwAp(num[left-1],num[L]);
    if((left-L-1)>=k) return FindKthLargest(num,k,L,left-2);
    else if((left-L-1)<k-1) return FindKthLargest(num,k-(left-L-1)-1,left,R);
    else return base;
}
int main(){
    int N,k;
    while(cin>>N>>k){
        int *num=(int *)malloc(N*sizeof(int));
        for(int i=0;i<N;i++){
            cin>>num[i];
            if(i+1>=k){
                int result=FindKthLargest(num,k,0,i);
                cout<<result<<endl;
            }
        }
        free(num);   
    }
    return 0;
}

这题用优先队列做更简单

#include <iostream>
#include <queue>
#include <vector>

using namespace std;

int main()
{
    int n, k;
    while (cin >> n >> k)
    {
        vector<int> a(n);
        for (int i = 0; i < n; i++)
            cin >> a[i];
        priority_queue<int, vector<int>, std::greater<int>> queue;
        for (int i = 0; i < k; i++)
            queue.push(a[i]);
        cout << queue.top() << '\n';
        for (int i = k; i < n; i++)
        {
            queue.push(a[i]);
            queue.pop();
            cout << queue.top() << '\n';
        }
    }
    return 0;
}

您好，我是有问必答小助手，您的问题已经有小伙伴帮您解答，感谢您对有问必答的支持与关注！
PS：问答VIP年卡 【限时加赠：IT技术图书免费领】，了解详情>>> https://vip.csdn.net/askvip?utm_source=1146287632