Pagini recente » Cod sursa (job #1941154) | Cod sursa (job #443747) | Cod sursa (job #2815153) | Cod sursa (job #1191723) | Cod sursa (job #634167)
Cod sursa(job #634167)
#include<iostream>
#include<fstream>
using namespace std;
const int q=3000;
int n,k,i,j,pivot;
long int M[q];
int main()
{
ifstream f("sdo.in",ios::in);
ofstream g("sdo.out",ios::out);
f>>n;
f>>k;
for(i=1;i<=n;i++)
f>>M[i];
for(i=1;i<=n;i++)
{
for(j=i+1;j<=n;j++)
{
if(M[i]>M[j])
{
pivot=M[i];
M[i]=M[j];
M[j]=pivot;
}
}
}
g<<M[k];
f.close();
g.close();
return 0;
}