Pagini recente » Cod sursa (job #1781548) | Cod sursa (job #324964) | Cod sursa (job #2488471) | Monitorul de evaluare | Cod sursa (job #1151590)
#include<cstdio>
#include<algorithm>
#include<vector>
#define M 2000000000
using namespace std;
FILE *f=fopen("sdo.in","r");
FILE *g=fopen("sdo.out","w");
int n,ord,i,x;
vector<int>v;
int main()
{
fscanf(f,"%d%d",&n,&ord);
for(i=1;i<=n;i++)
{
fscanf(f,"%d",&x);
v.push_back(x);
}
int nr=0;
while(nr<ord-1)
{
nr++;
v[min_element(v.begin(),v.end())-v.begin()]=M;
}
fprintf(g,"%d",*min_element(v.begin(),v.end()));
return 0;
}