Cod sursa(job #1922189)
Utilizator | Data | 10 martie 2017 16:19:37 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
#include <climits>
#include <algorithm>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int n, k;
int ct=0, mini=INT_MAX;
int a[3000001];
int main()
{
fin >> n >> k;
for(int i=1; i<=n; i++)
fin >> a[i];
nth_element(a+1, a+k, a+n+1);
fout << a[k];
return 0;
}