Topk算法(胡思乱想)

$a = array(2,13,800,42,8001,34,56,23,67,365,87665,54,68,3);

$k = 5;

$ok = [];

for($i=$k;$i>0 && count($a)>0;$i--)
{
    $len = count($a);
    $temp = '';
    $count=0;//统计过掉数
    foreach ($a as $key => $value) {
        $temp?"":$temp=$key;
        if($a[$temp]<$value)
        {
            $temp = $key;
        }
       
        if(++$count>=$len-$i-1)
        {
             break;
        }
    }
    
    $ok[] = $a[$temp];
    unset($a[$temp]);
}

print_r($ok);