Pagini recente » Cod sursa (job #2108868) | Istoria paginii runda/fmimorarcosmin2012 | Cod sursa (job #2669765) | Cod sursa (job #176559) | Cod sursa (job #1998515)
#include <iostream>
#include <fstream>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <stack>
#include <vector>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
#define ll long long
#define pb push_back
const int inf = 1e9 + 5;
const int NMax = 1e6 + 5;
int N;
int v[NMax];
int main() {
in>>N;
for (int i=1;i <= N;++i) {
in>>v[i];
}
bool sol = false;
srand(time(0));
for (int k=0;k < 10;++k) {
int val = v[rand() % N + 1],
nr = 0;
for (int i=1;i <= N;++i) {
if (v[i] == val) {
++nr;
}
}
if (nr > N/2) {
sol = true;
out<<val<<' '<<nr<<'\n';
break;
}
}
if (!sol) {
out<<"-1\n";
}
in.close();out.close();
return 0;
}