# The K-th largest number（小根堆）

16 篇文章 0 订阅

【题目要求】

Given N integer numbers, find the K-th largest number.
Requirement: design an algorithm with the time complexity O(NlogK).

【输入要求】

The first line contains N, K. In the following N lines, each line contains an integer value. ﻿
Note that N could be very large ( 1000000 <= N <= 10000000). You should allocate the memory dynamically and design the algorithm with the time complexity O(NlogK).

12 4
7
2
1
5
6
6
4
3
8
8
10
9
【输出要求】

8
【我的程序】

#include <iostream>
using namespace std;

long int num, *a;

void swapOp(long int x, long int y)
{
long int temp=a[x]; a[x]=a[y]; a[y]=temp;
}

void downOp(long int x)
{
while (x*2<=num)
{
x*=2;
if (x+1<=num && a[x+1]<a[x]) x++;
if (a[x]<a[x/2]) swapOp(x,x/2); else break;
}
}

void upOp(long int x)
{
while (x/2>=1){ if (a[x]<a[x/2]) swapOp(x,x/2); else break; x/=2; }
}

int main()
{
long int n,k,temp;
cin>> n>> k;  num=k;  a=new long int [k+1];

for (long int i=1;i<=k;i++) cin>>a[i];
for (long int i=k/2; i>=1; i--) downOp(i);

for (long int i=k+1; i<=n; i++)
{
cin>> temp;
if (temp>a)
{
swapOp(1,num); num--; downOp(1);
a[++num]=temp; upOp(num);
}
}

cout<< a;
return 0;
}

11-28 83
03-26 284                                                                          12-04 278
07-07 952
03-01 81
08-18 357
03-10 42
03-12 126
08-03 394
03-01 41
07-30 654
04-14 430
11-15 852
05-07 1599
03-28 29
09-24 763
08-19 21
10-19 141 点击重新获取   扫码支付  余额充值