Pagini recente » Cod sursa (job #3349568) | Cod sursa (job #3308952) | Cod sursa (job #3318972) | Cod sursa (job #2437444) | Cod sursa (job #3326418)
//https://infoarena.ro/problema/sdo
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("inline")
//#define _USE_MATH_DEFINES
//#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <fstream>
//#include <vector>
//#include <cstring>
//#include <cmath>
//#include <bitset>
//#include <queue>
//#include <stack>
//#include <utility>
#include <algorithm>
//#include <string>
//#include <map>
//#include <unordered_map>
//#include <set>
//#include <unordered_set>
//#include <cstdint>
//#include <climits>
//#include <iomanip>
//#include <cstdio>
//#include <tuple>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
const int NRMAX = 3000000;
int v[NRMAX];
int main()
{
//ios_base::sync_with_stdio(false);
//cin.tie(nullptr);
//cout.tie(nullptr);
int n, k, i;
fin >> n >> k;
for (i = 0; i < n; ++i)
fin >> v[i];
nth_element(v, v + k, v + n);
/*for (i = 0; i < n; ++i)
cout << v[i] << " ";*/
fout << v[k - 1] << "\n";
return 0;
}