Cod sursa(job #1728704)
Utilizator | Data | 13 iulie 2016 16:04:40 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include <fstream>
#include <algorithm>
#define NMAX 300001
using namespace std;
int main()
{
int n,k,v[NMAX];
ifstream f("sdo.in");
ofstream g("sdo.out");
f >> n >> k;
for(int i=0;i<n;i++)
f >> v[i];
sort(v,v+n);
g << v[k-1];
return 0;
}