Cod sursa(job #1014286)
| Utilizator | Data | 22 octombrie 2013 13:36:47 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("sdo.in");
ofstream fo("sdo.out");
long long v[3000001],n,k,y;
void ins(long long x) {
long long i=1;
while ((x>=v[i])&&(i<=k))
i++;
for (long long j=k;j>=i;j--)
v[j+1]=v[j];
v[i]=x;
}
int main()
{
fi>>n>>k;
for (long long i=1;i<=k;i++)
v[i]=1000000001;
for (long long i=1;i<=n;i++) {
fi>>y;
if (y<v[k])
ins(y);
}
fo<<v[k];
return 0;
}
