Pagini recente » Cod sursa (job #1489369) | Diferente pentru problema/pm2 intre reviziile 3 si 13 | Cod sursa (job #1617495) | Cod sursa (job #1482652) | Cod sursa (job #1678384)
#include <iostream>
#include <fstream>
#include <algorithm>
#define MAXN 3000001
#define INFILE "sdo.in"
#define OUTFILE "sdo.out"
using namespace std;
ifstream f(INFILE);
ofstream g(OUTFILE);
int n,k,a[MAXN];
int main()
{
f>>n>>k;
for(int i=1;i<=n;i++)
f>>a[i];
nth_element(a+1,a+k+1,a+n+1);
g<<a[k];
f.close();
g.close();
return 0;
}