Cod sursa(job #547531)
Utilizator | Data | 6 martie 2011 14:15:57 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
# include <fstream.h>
ifstream f("sdo.in");
ofstream g("sdo.out");
int n,i,j,k,aux,v[3000000];
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
if(v[i]>v[j])
{
aux=v[i];
v[i]=v[j];
v[j]=aux;
}
g<<v[k]<<'\n';
f.close();
g.close();
return 0;
}