Pagini recente » Cod sursa (job #2758107) | Borderou de evaluare (job #2346968) | Cod sursa (job #2331109) | Diferente pentru utilizator/indraznet09 intre reviziile 4 si 2 | Cod sursa (job #2759666)
#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
const int MAX = 3e6;
int v[MAX];
int main()
{
freopen("sdo.in", "r", stdin);
freopen("sdo.out", "w", stdout);
int n, k;
scanf("%d %d", &n, &k);
for (int i=0; i<n; i++)
scanf("%d", &v[i]);
sort(v, &v[n]);
printf("%d", v[k-1]);
}