Cod sursa(job #2035806)
Utilizator | Data | 9 octombrie 2017 20:36:03 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int v[3000010];
int main()
{
int n, k;
f >> n >> k;
for(int i = 1; i <= n; ++ i)
{
f >> v[i];
}
nth_element(v+1, v+k, v+n+1);
g << v[k];
return 0;
}