Cod sursa(job #2759666)
Utilizator | Data | 19 iunie 2021 17:45:10 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#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]);
}