Pagini recente » Cod sursa (job #1861113) | Cod sursa (job #2083160) | Cod sursa (job #2102123) | Cod sursa (job #2872857) | Cod sursa (job #2814123)
#include <fstream>
using namespace std;
ifstream cin ("elmaj.in");
ofstream cout ("elmaj.out");
int v[1000000];
int main(){
int n,k;cin >> n;
cin >> v[1];
int candidate = v[1], candidateCount = 1;
for (int i = 2; i <=n;++i){
cin >> v[i];
if (candidate ==v[i]){
++candidateCount;
}
else
{
candidateCount--;
}
if (candidateCount == 0){
candidate = v[i];
candidateCount = 1;
}
}
candidateCount = 0;
for (int i = 1; i <=n;++i)
if (candidate == v[i]){
candidateCount++;
}
if (candidateCount >= n/2+1)
cout << candidate << " " << candidateCount;
else
cout << -1;
cin.close();
cout.close();
return 0;
}