Cod sursa(job #527356)
Utilizator | Data | 31 ianuarie 2011 12:18:29 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
#include<algorithm>
#include<climits>
using namespace std;
int a[3000001], n, k;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
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;
}