Cod sursa(job #949749)
| Utilizator | Data | 14 mai 2013 20:42:19 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.25 kb |
#include<fstream>
#include<algorithm>
using namespace std;
int a[3000001],i,n,k;
int main()
{
ifstream f("sdo.in");
ofstream g("sdo.out");
f >> n >> k;
for (i=1;i<=n;i++)
f >> a[i];
nth_element(a+1,a+k,a+n+1);
g << a[k];
return 0;
}