Cod sursa(job #643995)
Utilizator | Data | 4 decembrie 2011 23:56:31 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.23 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int a[3000005],n,k,i;
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];
}