Cod sursa(job #475740)
Utilizator | Data | 8 august 2010 11:29:30 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<fstream>
#include<algorithm>
using namespace std;
const char iname[]="sdo.in";
const char oname[]="sdo.out";
const int maxn=3000005;
ifstream f(iname);
ofstream g(oname);
int a[maxn],i,n,k;
int main()
{
f>>n>>k;
for(i=1;i<=n;++i)
f>>a[i];
nth_element(a+1,a+k,a+n+1);
g<<a[k]<<"\n";
}