Cod sursa(job #1533677)
Utilizator | Data | 22 noiembrie 2015 20:59:56 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
#define MAX 3000010
int a[MAX];
int main()
{
int n, k, i;
fin >> n >> k;
for(i= 1 ; i <= n ; i++)
{
fin >> a[i];
}
nth_element(a + 1, a + k + 1, a + n + 1);
fout << a[k] << " ";
}