- #include<cstdio>
- #include<iostream>
- #include<string>
- #include<algorithm>
- using namespace std;
- #define dsi(n) int n;scanf("%d",&n)
- #define si(n) scanf("%d",&n)
- #define f(i,n) for(int i=1;i<=n;++i)
- #define fi(n) f(i,n)
- #define f0(i,n) for(int i=0;i!=n;++i)
- #define fd(i,n) for(int i=n;i>=1;--i)
- #define ci const int&
- #define foreach(i,s) for(typeof(s.begin()) i=s.begin();i!=s.end();++i)
- #define c(x) const x&
- class st
- {
- int x,y;
- friend bool operator <(const st&a,const st&b){return a.x<b.x;}
- };
- string s;
- int a[10000]={};
- int main()
- {
- dsi(n);dsi(k);
- fi(n)
- {
- si(a[i]);
- }
- sort(a+1,a+n+1);
- cout<<a[n-k+1]<<endl;
- return 0;
- }