Pagini recente » Borderou de evaluare (job #227118) | Diferente pentru problema/sortnet intre reviziile 1 si 7 | Borderou de evaluare (job #1318432) | Cod sursa (job #2199879) | Cod sursa (job #2146554)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("sdo.in");
ofstream fout ("sdo.out");
const int Nmax = 3000005;
int a[Nmax] , n , k;
int main()
{
fin >> n >> k;
for(int i = 1 ; i <= n ; i++)
fin >> a[i];
nth_element(a + 1 , a + k , a + n + 1);
fout << a[k] << "\n";
fin.close();
fout.close();
return 0;
}