Cod sursa(job #1451576)
Utilizator | Data | 17 iunie 2015 18:37:20 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
const int NMax = 3000005;
int N,K,A[NMax];
int main()
{
fin>>N>>K;
for(int i = 1; i <= N; i++)
fin>>A[i];
sort(A+1,A+N);
fout<<A[K]<<" ";
return 0;
}