Cod sursa(job #1929697)
| Utilizator | Data | 17 martie 2017 22:45:16 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.29 kb |
#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
ifstream in("sdo.in");
ofstream out("sdo.out");
int n, k, v[3000001];
int main(){
in>>n>>k;
for(int i=0; i<n; i++)in>>v[i];
nth_element(v, v+k-1, v+n);
out<<v[k-1];
return 0;
}
