Cod sursa(job #1955657)
| Utilizator | Data | 6 aprilie 2017 09:40:09 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#include <queue>
using namespace std;
ifstream f("sdo.in"); ofstream g("sdo.out");
int a[30000005];
int n,k,x;
int main() {
int i;
f>>n>>k;
for(i = 1; i <= n; ++i) {
f>>a[i];
}
nth_element(a + 1, a + k, a + n +1);
g<<a[k];
return 0;
}
