Cod sursa(job #2627442)
Utilizator | Data | 10 iunie 2020 18:33:02 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<bits/stdc++.h>
using namespace std;
int v[100000];
ifstream in("sdo.in");
ofstream out("sdo.out");
int main()
{
int n,m,k,i,j,aux;
in>>n>>k;
for(i=1;i<=n;i++)
in>>v[i];
for(i=1;i<=n;i++)
{
for(j=1;j<=n-i-1;j++)
if(v[j+1]<v[j])
{
aux=v[j];
v[j]=v[j+1];
v[j+1]=aux;
}
}
out<<v[k];
return 0;
}