Cod sursa(job #546877)
Utilizator | Data | 5 martie 2011 16:44:49 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
using namespace std;
int main()
{
ifstream fin("sdo.in");
ofstream fout("sdo.out");
long int a[100000];
int k,n,i;
fin>>n>>k;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=1;i<n;i++)
for(int j=i+1;j<=n;j++)
if(a[i]>a[j])
{
int aux=a[i];
a[i]=a[j];
a[j]=aux;
}
fout<<a[k];
return 0;
}