Pagini recente » Cod sursa (job #591058) | Cod sursa (job #1100432) | Cod sursa (job #256175) | Cod sursa (job #993854) | Cod sursa (job #1554562)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int v[100030];
int main()
{
int n,k,i;
f>>n>>k;//>>q>>x>>y>>z;
//v[1] = q;
for(i = 1 ; i <= n ; i ++ )
{
// v[i] = ( v[i-1] * x + y) % z + k ;
f>>v[i];
}
nth_element(v+1,v+k,v+n+1);
/*s = 0;
for( i =n-k+1; i <= n; i ++ )
{
s = s + v[i];
}
s = s - ((k-1)/2)*k;
cout<<s<<endl;
for(i=1;i<=n;i++)
cout<<v[i]<<" ";*/
g<<v[k];
f.close();
g.close();
}