Cod sursa(job #2058722)
| Utilizator | Data | 6 noiembrie 2017 01:05:39 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cmath>
#define DN 3000005
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int n,x[DN],k;
int main()
{
fin>>n>>k;
for(int i=1;i<=n;i++)
fin>>x[i];
nth_element(x+1,x+k,x+n+1);
fout<<x[k];
}
