Cod sursa(job #425572)
| Utilizator | Data | 25 martie 2010 21:18:54 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.37 kb |
#include <cstdio>
#include <istream>
#include <algorithm>
using namespace std;
#define NMAX 3000005
int N, K;
int V[NMAX];
void citire()
{
scanf("%d%d",&N,&K);
for(int i = 1 ; i <= N ; i++)
scanf("%d",&V[i]);
}
int main()
{
freopen("sdo.in","r",stdin);
freopen("sdo.out","w",stdout);
citire();
sort(V + 1, V + N);
printf("%d",V[K]);
return 0;
}
