Cod sursa(job #1165964)
Utilizator | Data | 3 aprilie 2014 08:26:30 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int A[3000005];
int main() {
int n, k;
f >> n >> k;
for(int i = 1; i <= n; ++i)
f >> A[i];
nth_element(A + 1, A + k, A + n + 1);
g << A[k] << '\n';
}