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