Cod sursa(job #1875573)
Utilizator | Data | 11 februarie 2017 12:19:43 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
#include<algorithm>
#define MAX 3000001
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int a[MAX];
int main()
{
int i, n, k;
fin>>n>>k;
for (i = 0; i <= n - 1; i++)
fin>>a[i];
fin.close();
nth_element(a, a + k - 1, a + n);
fout<<a[k - 1];
fout.close();
return 0;
}