Cod sursa(job #1333301)
Utilizator | Data | 2 februarie 2015 23:30:09 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
#include <cstdio>
#include <algorithm>
#define NM 3000005
using namespace std;
int n,k,i,v[NM];
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 ", &v[i]);
sort(v+1, v+n+1);
printf("%d\n", v[k]);
return 0;
}