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