Pagini recente » Cod sursa (job #628641) | Cod sursa (job #2714105) | Cod sursa (job #2032490) | Cod sursa (job #123757) | Cod sursa (job #373411)
Cod sursa(job #373411)
#include<fstream>
#include<algorithm>
using namespace std;
int s[3000001];
int main(){
ifstream f("sdo.in");
ofstream g("sdo.out");
int n, k, i, j, min, pmin;
f>>n>>k;
for(i=0;i<n;i++)
f>>s[i];
for(i=0;i<k;i++){
min=s[i];pmin=i;
for(j=i+1;j<n;j++)
if(s[j]<min){
min=s[j];
pmin=j;
}
s[pmin]=s[i];
s[i]=min;
}
--k;
g<<s[k]<<endl;
g.close();
return 0;
}