Cod sursa(job #1322486)
Utilizator | Data | 20 ianuarie 2015 08:39:41 | |
---|---|---|---|
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 f ("sdo.in");
ofstream g ("sdo.out");
int a[3000005], n, k;
void citire()
{
f >> n >> k;
for(int i = 1; i <= n; ++i)
f >> a[i];
}
int main()
{
citire();
nth_element(a+1, a+k, a+n+1);
g << a[k] << "\n";
}