Cod sursa(job #404145)
Utilizator | Data | 25 februarie 2010 20:45:28 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
using namespace std;
int main()
{
int ok,n,i,k,aux;
long long a[3000005];
ifstream fin("sdo.in");
ofstream fout("sdo.out");
fin>>n>>k;
for(i=1;i<=n;i++)
fin>>a[i];
ok=1;
while(ok==1)
{
ok=0;
for(i=1;i<=n;i++)
if(a[i]>a[i+1])
{
aux=a[i];
a[i]=a[i+1];
a[i+1]=aux;
ok=1;
}
}
fout<<a[k];
fin.close();
fout.close();
}