Pagini recente » Cod sursa (job #3334541) | Cod sursa (job #841753) | Cod sursa (job #1755693) | Cod sursa (job #3316291) | Cod sursa (job #3349531)
#include <bits/stdc++.h>
using namespace std;
int k = 20;
long long v[1000005], n;
int main()
{
ifstream f("elmaj.in");
ofstream g("elmaj.out");
f >> n;
for(int i = 1; i <= n; i ++)
f >> v[i];
std::random_device dev;
std::mt19937 rng(dev());
std::uniform_int_distribution<std::mt19937::result_type> dist(1, n);
for(int i = 1; i <= k; i ++)
{
int cand = dist(rng), ct = 0;
for(int i = 1; i <= n; i ++)
if(v[i] == v[cand])
ct ++;
if(ct >= n / 2 + 1)
{
g << v[cand] << " " << ct;
return 0;
}
}
g << -1;
return 0;
}