Cod sursa(job #1926143)
| Utilizator | Data | 13 martie 2017 23:36:23 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <cstdio>
#include <algorithm>
#define NMax 3000000
using namespace std;
int v[NMax+1];
int N,K;
int main(){
FILE* fin = fopen("sdo.in","r");
FILE* fout = fopen("sdo.out","w");
int i;
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\n",v[K]);
fclose(fin);
fclose(fout);
return 0;
}
