Cod sursa(job #2001956)
Utilizator | Data | 18 iulie 2017 11:15:07 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include <fstream>
#include <algorithm>
using namespace std;
#define MAX_N 3000005
ifstream f ("sdo.in");
ofstream g ("sdo.out");
int A[MAX_N],N,K;
int main()
{
f>>N>>K;
for(int i=1;i<=N;++i) f>>A[i];
nth_element(A+1, A+K, A+N+1);
g<<A[K];
}