Cod sursa(job #1609854)
Utilizator | Data | 23 februarie 2016 08:42:27 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("sdo.in");
ofstream out("sdo.out");
int n, p, i, v[3000005];
int main()
{
in>>n>>p;
for(i=1;i<=n;i++)
in>>v[i];
nth_element(v+1, v+p, v+n+1);
out<<v[p];
return 0;
}