#include <iostream> #include <algorithm> #include <queue> using namespace std; int main(){ int n; while(scanf("%d",&n)!=EOF){ priority_queue<int, vector<int>, greater<int>> Q; int tmp; for(int i=0;i<n;i++){ scanf("%d", &tmp); Q.push(tmp); } int k,x1; int x2=0; scanf("%d", &k); x1=Q.top(); for(int i=1;i<k;i++){ Q.pop(); if(x1==Q.top()){ i--; } x1=Q.top(); } x1=Q.top(); printf("%d\n", x1); } }