Cod sursa(job #2045554)
Utilizator | Data | 22 octombrie 2017 15:26:02 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <fstream>
#include <algorithm>
using namespace std;
const int Nmax=3000005;
ifstream f("sdo.in");
ofstream g ("sdo.out");
int v[Nmax],n,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];
}