Cod sursa(job #2646540)
Utilizator | Data | 1 septembrie 2020 14:18:06 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int main()
{
int n, k, el;
fin >> n >> k;
k--;
n--;
int v[n];
for (int i = 0; i < n; i++)
fin >> v[i];
nth(a + 1, a + k + 1, a + n + 1) // O(n)
cout << a[k];
}