第k小数(桶排序)

#include<bits/stdc++.h>
using namespace std;
const int maxn=5e6;
inline int read(){
    int x = 0, f = 1;
    char ch = getchar();
    while(ch < ‘0‘ || ch > ‘9‘){
        if (ch == ‘-‘)
            f = -1;
        ch = getchar();
    }
    while(ch >= ‘0‘ && ch <= ‘9‘){
        x = (x<<1) + (x<<3) + (ch^48);
        ch = getchar();
    }
    return x * f;
}
int s[maxn+5];
int main(){
    int m,n,k,t;
    t=read();
    for(int i=0;i<t;i++){
        n=read();
        k=read();
        fill(s,s+maxn,0);
        for(int j=0;j<n;j++){
            m=read();
            s[m]++;
        }
        int cnt=0;
        for(int o=1;o<=maxn;o++){
            while(s[o]){
                s[o]--;cnt++;
                if(cnt==k){cout<<o<<endl;break;}
            }
        }
    }
    return 0;