Cod sursa(job #786800)
Utilizator | Data | 12 septembrie 2012 09:46:26 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
#include <algorithm>
#define MAXN 3000005
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int n,k,v[MAXN];
int main()
{
int i;
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]<<'\n';
f.close();
g.close();
return 0;
}