Pagini recente » Cod sursa (job #1515216) | Cod sursa (job #1660861) | Cod sursa (job #987245) | Cod sursa (job #2959456) | Cod sursa (job #1319924)
#include <iostream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <set>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <utility>
#include <string>
#include <cstring>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <limits>
#include <sstream>
#include <deque>
#include <bitset>
#include <complex>
#include <functional>
#include <memory>
#include <numeric>
#define x first
#define y second
typedef std::pair<int, int> pii;
using namespace std;
int main () {
freopen("sdo.in", "r", stdin);
freopen("sdo.out", "w", stdout);
int n, x[3000003], k;
scanf("%d%d ", &n, &k);
for(int i = 0; i < n; i++)
scanf("%d ", &x[i]);
sort(x, x + n);
int v = x[k - 1];
printf("%d", v);
return 0;
}