Cod sursa(job #1607723)
Utilizator | Data | 21 februarie 2016 15:51:57 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include<iostream>
#include<fstream>
using namespace std;
int v[3000001];
int main()
{
int n,k,i;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>v[i];
}
for(i=1;i<n;i++)
{
for(int j=i+1;j<=n;j++)
{
if(v[i]>v[j])
{
int aux=v[i];
v[i]=v[j];
v[j]=aux;
}
}
}
fout<<v[k];
fin.close();
fout.close();
return 0;
}