Cod sursa(job #2625802)
| Utilizator | Data | 6 iunie 2020 10:15:43 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <algorithm>
using namespace std;
FILE * fin, * fout;
int v[3000005];
int main() {
fin = fopen("sdo.in","r");
fout = fopen("sdo.out","w");
int N, K;
fscanf(fin,"%d%d",&N,&K);
for ( int i = 1; i <= N; i++ ){
fscanf(fin,"%d",v+i);
}
nth_element(v+1, v+K, v+N+1);
//cout << v[K] << "\n";
fprintf(fout,"%d",v[K]);
fclose(fin);
fclose(fout);
return 0;
}