Cod sursa(job #2196009)
Utilizator | Data | 18 aprilie 2018 08:03:51 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("sdo.in");
ofstream out("sdo.out");
#define MAXIM 3000010
int *v=new int[MAXIM]();
int main()
{
int n,k;
in>>n>>k;
for(int i=0;i<n;i++) in>>v[i];
nth_element(v,v+k-1,v+n);
out<<v[k-1];
return 0;
}