Cod sursa(job #1500254)
Utilizator | Data | 11 octombrie 2015 17:35:30 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
#include<algorithm>
#include<iostream>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
#define MAXN 3000050
int n, k, vals[MAXN];
int main()
{
fin>>n>>k;
for(int i=1; i<=n; ++i)
fin>>vals[i];
nth_element(vals+1, vals+k, vals+n+1);
fout<<vals[k]<<'\n';
return 0;
}