Cod sursa(job #2646549)
Utilizator | Data | 1 septembrie 2020 14:28:34 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<alghoritm>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int n, k, a[3000001];
int main()
{
fin >> n >> k;
for (int i = 1; i <= n; i++)
fin >> a[i];
nth(a + 1, a + k + 1, a + n + 1)
fout << a[k];
return 0;
}