Pagini recente » Cod sursa (job #697699) | Cod sursa (job #1289438) | Cod sursa (job #1401717) | Cod sursa (job #1409831) | Cod sursa (job #1786751)
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
#include <fstream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <cstring>
#include <map>
#include <iomanip>
#include <unordered_map>
#include <stack>
#include <bitset>
#define MOD 8192
#define pb push_back
#define INF 0x3f3f3f3f
#define ll long long
#define NMAX 3000005
using namespace std;
typedef pair<int, int> pii;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int v[NMAX];
int main() {
int n,k,i,res=0,j,rez,mask;
fin>>n>>k;
for(i=1;i<=n;++i) fin>>v[i];
nth_element(v+1,v+k,v+n+1);
fout<<v[k];
return 0;
}