Cod sursa(job #1194938)
Utilizator | Data | 5 iunie 2014 13:54:02 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <cstdio>
#include <algorithm>
#define N 3000010
using namespace std;
int n,k,i,x[N];
int main()
{
freopen("sdo.in","r",stdin);
freopen("sdo.out","w",stdout);
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++)
scanf("%d",&x[i]);
nth_element(x+1,x+k,x+n+1);
printf("%d",x[k]);
return 0;
}