Cod sursa(job #1194206)
Utilizator | Data | 3 iunie 2014 09:51:28 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
FILE *f;
int n,k,i,a[3000010],aux;
int main()
{
f=freopen("sdo.in","r",stdin);
f=freopen("sdo.out","w",stdout);
aux=scanf("%d%d",&n,&k);
for(i=1;i<=n;i++)
aux=scanf("%d",&a[i]);
nth_element(a+1,a+k,a+n+1);
aux=printf("%d",a[k]);
return 0;
}