Cod sursa(job #545937)
Utilizator | Data | 4 martie 2011 09:53:48 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<stdio.h>
#include<algorithm>
using namespace std;
FILE *in,*out;
int n,i,k,V[3000000];
int main()
{
in=fopen("sdo.in","rt");
out=fopen("sdo.out","wt");
fscanf(in,"%d %d",&n,&k);
for(i=1;i<=n;i++)
fscanf(in,"%d",&V[i]);
nth_element(V+1,V+k,V+n+1);
fprintf(out,"%d",V[k]);
return 0;
}