TLE警示后人

#include<bits/stdc++.h>
using namespace std;
int m, n, v[2000010];
int main() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> v[i];
    }
    sort(v + 1, v + 1 + n);
    cout << v[m + 1] << ' ';
}

sort绝对TLE