Cod sursa(job #1567562)
Utilizator | Data | 13 ianuarie 2016 15:40:56 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.26 kb |
#include <fstream>
#include <algorithm>
#define Nmax 3000001
using namespace std;
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];
return 0;
}