Cod sursa(job #2191430)
Utilizator | Data | 2 aprilie 2018 20:16:57 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.26 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int n,v[3000001],k;
ifstream in("sdo.in");
ofstream out("sdo.out");
int main()
{int i=1;
in>>n>>k;
for(i=0;i<n;i++)
in>>v[i];
sort(v,v+n);
out<<v[k-1];
return 0;
}