Cod sursa(job #3289291)
Utilizator | Data | 26 martie 2025 13:55:05 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
#include<algorithm>
using namespace std;
ifstream cin ( "sdo.in" );
ofstream cout ( "sdo.out" );
const int Nmax = 3e6 + 1;
int a[Nmax];
int main()
{
int n, k, i;
cin >> n >> k;
for( i = 1; i <= n; i ++ )
cin >> a[i];
sort( a + 1, a + n + 1 );
cout << a[k] << '\n';
return 0;
}