Cod sursa(job #634167)
Utilizator | Andrei Diaconu andrei_diaconu | Data | 15 noiembrie 2011 19:22:27 |
---|---|---|---|
Problema | Statistici de ordine | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#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;
}