一般通过排序算法过来问下不开O2后面两个测试点TLE的原因

Sirius_H2SO4 @ 2023-08-08 14:03:34

#include<iostream>
#include<algorithm>
using namespace std;
int n,k,a[5001145];
int main(){
    scanf("%d%d",&n,&k);
    for(int i=0;i<n;i++){
        scanf("%d",&a[i]);
    }
    sort(a,a+n);
    cout << a[k];
}

by 落花月朦胧 @ 2023-08-08 14:05:04

@ThisIsSirius_859 n是 5000000，sort是 \mathbb{O(n\log n)} 过不了。

by Sirius_H2SO4 @ 2023-08-08 14:13:07

@落花月朦胧 懂了，感谢大佬

by Gjanuary @ 2023-08-17 13:28:35

我用归并后边的2个点也过不去