Cod sursa(job #1333302)
Utilizator | Data | 2 februarie 2015 23:31:03 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
#include <algorithm>
#define NM 3000005
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int n,k,i,v[NM];
int main()
{
fin >> n >> k;
for (i=1; i<=n; i++)
fin >> v[i];
sort(v+1, v+n+1);
fout << v[k] << '\n';
fin.close();
fout.close();
return 0;
}