Cod sursa(job #3173780)
Utilizator | Data | 23 noiembrie 2023 18:13:12 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("sdo.in");
ofstream cout("sdo.out");
#define MAXN 3000000
int v[MAXN+1];
int main()
{
int n, k;
cin>>n>>k;
int i;
for(i=0; i<n; i++)
cin>>v[i];
nth_element(v, v+k-1, v+n);
cout<<v[k-1]<<" ";
return 0;
}