Cod sursa(job #2291594)
Utilizator | Data | 28 noiembrie 2018 11:37:59 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 60 |
Compilator | cpp-32 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int n,i,k,v[3000001];
int main()
{
ifstream fin("sdo.in");
ofstream fout("sdo.out");
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>v[i];
}
sort(v+1,v+n+1);
fout<<v[k];
fin.close();
fout.close();
return 0;
}