Cod sursa(job #1612339)
Utilizator | Data | 24 februarie 2016 20:09:18 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
const int NMax = 3000005;
int N,K,X[NMax];
int main()
{
fin>>N>>K;
for(int i = 1; i<=N; i++)
fin>>X[i];
nth_element(X+1,X+K,X+N+1);
fout<<X[K]<<"\n";
return 0;
}