Cod sursa(job #577833)
Utilizator | Data | 10 aprilie 2011 17:46:14 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
const int M=3000003;
int n, k, a[M];
void citire()
{
scanf ("%d %d ",&n,&k);
for (int i=0; i<n; ++i)
scanf ("%d ",&a[i]);
}
int main()
{
freopen ("sdo.in","r",stdin);
freopen ("sdo.out","w",stdout);
citire();
nth_element(a,a+k,a+n);
printf ("%d\n",a[k-1]);
return 0;
}