Cod sursa(job #1374044)
Utilizator | Data | 4 martie 2015 22:22:24 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int n, m, i, q, ok, a[3000003];
int main()
{
ifstream fin("sdo.in");
ofstream fout("sdo.out");
fin>>n>>m;
for(i=1; i<=n; i++) fin>>a[i];
nth_element(a+1, a+m, a+n+1);
fout<<a[m];
return 0;
}