Cod sursa(job #1184824)
Utilizator | Data | 14 mai 2014 11:16:51 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin ("sdo.in");
ofstream fout ("sdo.out");
int A[3000005], n, k;
int main()
{
fin>>n>>k;
for(int i=1;i<=n;++i)
fin>>A[i];
nth_element(A+1, A+k, A+k+1);
fout << A[k] << "\n";
fin.close();
fout.close();
return 0;
}