Cod sursa(job #1526015)
Utilizator | Data | 15 noiembrie 2015 20:09:06 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include <fstream>
#define Xp 3000004
#include <algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int n,k,i,v[Xp];
int main()
{
f>>n>>k;
for(i=1;i<=n;++i) f>>v[i];
nth_element(v+1,v+k,v+1+n);
g<<v[k];
return 0;
}