Pagini recente » Borderou de evaluare (job #1301677) | Borderou de evaluare (job #1078091) | Borderou de evaluare (job #2166017) | Borderou de evaluare (job #1766567) | Cod sursa (job #369659)
Cod sursa(job #369659)
#include <fstream>
#include <algorithm>
using namespace std;
#define MAX_N 3000005
ifstream fin ("sdo.in");
ofstream fout ("sdo.out");
int A[MAX_N], N, K;
void citire()
{
fin >> N >> K;
for(int i = 1; i <= N; ++i)
fin >> A[i];
}
int main()
{
citire();
nth_element(A+1, A+K, A+N+1);
fout << A[K] << "\n";
}