Cod sursa(job #2378069)
Utilizator | Data | 11 martie 2019 17:08:31 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int n,k,v[1000],nr,a;
int main()
{
int i,j;
f>>n>>k;
for(i=0; i<n; i++)
f>>v[i];
for(i=0; i<n; i++)
for(j=i+1; j<n; j++)
{
if(v[i]>=v[j])
{
nr++;
swap(v[i],v[j]);
}
if(nr==k)
a=v[i];
}
cout<<a;
return 0;
}