Cod sursa(job #1587991)
Utilizator | Data | 2 februarie 2016 18:28:20 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<stdio.h>
#include<algorithm>
#define MAXN 3000001
using namespace std;
int v[MAXN];
int main(){
FILE*fin=fopen("sdo.in", "r");
FILE*fout=fopen("sdo.out", "w");
int n, i, k;
fscanf(fin, "%d%d", &n, &k);
for(i=1; i<=n; i++)
fscanf(fin, "%d", &v[i]);
nth_element(v+1, v+k, v+n+1);
fprintf(fout, "%d", v[k]);
return 0;
}