Cod sursa(job #1330381)
Utilizator | Data | 30 ianuarie 2015 17:11:26 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
#include <algorithm>
#define NMax 3000005
using namespace std;
ifstream in ("sdo.in");
ofstream out ("sdo.out");
int A[NMax];
int main()
{
int N,K;
in>>N>>K;
for (int i=1;i<=N;i++)
in>>A[i];
nth_element (A+1,A+K,A+N+1);
out<<A[K];
return 0;
}