Cod sursa(job #1244605)
Utilizator | Data | 17 octombrie 2014 20:50:43 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int k,N,A[3000001];
int main(){
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];
return 0;
}