Cod sursa(job #1036385)
Utilizator | Data | 19 noiembrie 2013 12:14:58 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
long long k,n,v[3000001],i;
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
f>>v[i];
nth_element(v+1,v+k+1,v+n+1);
g<<v[k];
f.close();g.close();
return 0;
}