Cod sursa(job #633955)
Utilizator | Data | 15 noiembrie 2011 10:39:53 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int a[3000005];
int main()
{
int n,k;
ifstream f("sdo.in");
ofstream g("sdo.out");
f>>n>>k;
for (int i=1; i<=n; ++i)
f>>a[i];
nth_element(a+1, a+k, a+n+1);
g<<a[k];
return 0;
}