Cod sursa(job #1695109)
Utilizator | Data | 26 aprilie 2016 16:21:35 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int n, v[3000003], k;
int main()
{
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;
}