Cod sursa(job #543437)
Utilizator | Data | 28 februarie 2011 00:29:39 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<fstream>
#include<algorithm>
//#define MAX 3000002
using namespace std;
unsigned long n,k,i,v[3000002];
int main()
{
ifstream f("sdo.in");
ofstream g("sdo.out");
f>>n>>k;
for(i=1;i<=n;i++)
f>>v[i];
nth_element(v+1,v+k,v+n+1);
g<<v[k];
g.close();
f.close();
}