Cod sursa(job #935247)
Utilizator | Data | 2 aprilie 2013 14:57:30 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
#include <algorithm>
#define nMax 3000005
using namespace std;
ifstream fin("sdo.in"); ofstream fout("sdo.out");
int a[nMax], n, k;
int main()
{
fin >> n >> k;
for(int i = 1; i <= n; i++)
fin >> a[i];
nth_element(a + 1, a + k, a + n + 1);
fout << a[k];
fin.close(); fout.close();
return 0;
}