Cod sursa(job #2092589)
Utilizator | Data | 21 decembrie 2017 23:03:25 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
#define MAX_N 3000001
int main()
{
int n,k;
f >> n >> k;
int v[n];
for(int i = 0 ; i <n; i++)
{
f >> v[i];
}
f.close();
int r = rand() % n;
nth_element(v+1, v+r, v+n+1);
g << v[k-1];
g.close();
}