Cod sursa(job #905097)
Utilizator | Data | 5 martie 2013 15:59:24 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <stdio.h>
#include <algorithm>
using namespace std;
FILE *f,*s;
int n,k;
int v[3000005];
int main()
{
f=fopen("sdo.in","r");
s=fopen("sdo.out","w");
fscanf(f,"%d %d",&n,&k);
for(int i=1;i<=n;i++)
fscanf(f,"%d",&v[i]);
sort(v+1,v+n+1);
fprintf(s,"%d",v[k]);
fclose(s);
return 0;
}