Cod sursa(job #1463614)
Utilizator | Teodorescu Stefan Eduard TeodorescuStefanEduard | Data | 21 iulie 2015 12:56:22 |
---|---|---|---|
Problema | Statistici de ordine | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
fstream in("sdo.in", ios::in);
fstream out("sdo.out", ios::out);
#define nmax 3000005
long a[nmax];
int main()
{
int i,j,n,k,x,kk=0,mink=0;
in>>n>>k;
for(i=0;i<n;i++)
in>>a[i];
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
if(a[i]>a[j])
{
x=a[i];
a[i]=a[j];
a[j]=x;
}
i=0;
while(kk<k)
{
if(a[i]>mink)
{
mink=a[i];
kk++;
}
i++;
}
out<<a[i-1];
in.close();
out.close();
return 0;
}