Cod sursa(job #1732779)
| Utilizator | Data | 22 iulie 2016 15:39:13 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <stdio.h>
#include <algorithm>
#define MAXN 3000001
FILE *inputFile = fopen("sdo.in", "r"), *outputFile = fopen("sdo.out", "w");
int numbers[MAXN];
int n, k, i, nr;
int main()
{
fscanf(inputFile, "%d %d", &n ,&k);
for(i = 0; i < n; i++)
fscanf(inputFile, "%d", numbers + i);
std::sort(numbers, numbers + n);
fprintf(outputFile, "%d", numbers[k - 1]);
return 0;
}