Cod sursa(job #1438088)
Utilizator | Data | 18 mai 2015 23:58:18 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
#define Nmax 3000002
FILE *f = fopen ( "sdo.in", "r" );
FILE *g = fopen ( "sdo.out", "w" );
int v[Nmax];
int main(){
int N, K;
fscanf ( f, "%d%d", &N, &K );
for ( int i = 1; i <= N; ++i )
fscanf ( f, "%d", &v[i] );
nth_element ( v + 1, v + K + 1, v + N + 1 );
fprintf ( g, "%d", v[K] );
return 0;
}