Cod sursa(job #2152042)
Utilizator | Data | 5 martie 2018 10:29:25 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <algorithm>
#define nmax 3000003
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int v[nmax];
int main()
{
int n,k;
char c;
fin>>n>>k;
c=fin.get();
for(int i=1;i<=n;i++)
{
int nr=0;
c=fin.get();
while(c>='0'&&c<='9')
{
nr=nr*10+c-'0';
c=fin.get();
}
v[i]=nr;
}
nth_element(v+1,v+k,v+n+1);
fout<<v[k];
return 0;
}