Cod sursa(job #371158)
Utilizator | Andrei Misarca Mishu91 | Data | 3 decembrie 2009 22:53:38 |
---|---|---|---|
Problema | Statistici de ordine | Scor | Ascuns |
Compilator | cpp | Status | done |
Runda | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream fin ("sdo.in");
ofstream fout("sdo.out");
#define MAX_N 3000005
#define INF 0x3f3f3f3f
int N, K, A[MAX_N];
void citire()
{
fin >> N >> K;
for(int i = 1; i <= N; ++i)
fin >> A[i];
}
void solve()
{
int poz, val;
for(int k = 1; k <= K; ++k)
{
val = INF;
for(int i = 1; i <= N; ++i)
if(A[i] < val)
val = A[i],
poz = i;
A[poz] = INF;
}
fout << val << "\n";
}
int main()
{
citire();
solve();
}