Cod sursa(job #1554564)
Utilizator | Data | 21 decembrie 2015 14:30:56 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int main()
{
int n,k;
int v[3000001];
f>>n>>k;
for(int i=1;i<=n;i++)
cin>>v[i];
nth_element(v+1,v+k,v+n+1);
g<<v[k];
return 0;
}