Cod sursa(job #3155744)
| Utilizator | Data | 9 octombrie 2023 16:36:56 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream cin ("sdo.in");
ofstream cout ("sdo.out");
vector <int> sir(3000000);
int main ()
{
int lungime , ordine;
cin >> lungime >> ordine;
for (int indice = 0 ; indice < lungime ; indice++)
cin >> sir[indice];
nth_element(sir.begin() , sir.begin() + ordine - 1 , sir.begin() + lungime);
cout << sir[ordine - 1];
cout.close(); cin.close();
return 0;
}