Cod sursa(job #1921526)
Utilizator | Data | 10 martie 2017 13:03:07 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f ("sdo.in");
ofstream g ("sdo.out");
int v[3000005],n,k,i;
int main(){
f>>n>>k;
for (i=1;i<=n;i++) f>>v[i];
nth_element(v+1,v+k,v+n+1);
g<<v[k];
return 0;
}