Cod sursa(job #800394)
Utilizator | Data | 21 octombrie 2012 15:28:19 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<iostream>
#include<cstdio>
using namespace std;
int n,k,i,j,c,M[100];
int main()
{
freopen("sdo.in","r",stdin);
freopen("sdo.out","w",stdout);
cin>>n>>k;
for(i=1;i<=n;i++)
cin>>M[i];
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
{
if(M[i]>M[j])
{
c=M[i];
M[i]=M[j];
M[j]=c;
}
}
cout<<M[k];
return 0;
}