Cod sursa(job #1293653)
Utilizator | Data | 16 decembrie 2014 12:09:09 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
//Sortare cu citire cstdio
#include <cstdio>
#include <algorithm>
#define nmax 30000057
using namespace std;
FILE *f=fopen("sdo.in","r");
FILE *g=fopen("sdo.out","w");
int n,k;
int v[nmax];
int main()
{int i,j;
fscanf(f,"%d %d",&n,&k);
for (i=1;i<=n;i++) fscanf(f,"%d",&v[i]);
sort(v+1,v+n+1);
fprintf(g,"%d",v[k]);
return 0;
}