Cod sursa(job #370055)
Utilizator | Data | 30 noiembrie 2009 01:10:00 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | Ascuns |
Compilator | cpp | Status | done |
Runda | Marime | 0.39 kb |
#include <fstream>
using namespace std;
#define MAX_N 3000005
ifstream fin ("sdo.in");
ofstream fout ("sdo.out");
int N, K, A[MAX_N], Sol, P;
int main()
{
fin >> N >> K;
for(int i = 1; i <= N; ++i)
fin >> A[i];
for(int i = 1; i <= N; ++i)
{
int sol = 0;
for(int j = 1; j <= N; ++j)
if(A[j] < A[i])
++sol;
if(sol < K && sol > Sol)
Sol = sol, P = i;
}
fout << A[P];
}