Cod sursa(job #934993)
Utilizator | Data | 1 aprilie 2013 00:28:41 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <cstdio>
#include <algorithm>
FILE *f=fopen("sdo.in","r");
FILE *g=fopen("sdo.out","w");
using namespace std;
#define MAX_N 3000005
int A[MAX_N], N, K;
void citire()
{
fscanf(f,"%d%d",&N,&K);
for(int i = 1; i <= N; ++i)
fscanf(f,"%d",&A[i]);
}
int main()
{
citire();
nth_element(A+1, A+K, A+N+1);
fprintf(g,"%d",A[K]);
}