Pagini recente » Cod sursa (job #3174091) | Cod sursa (job #3130082) | Cod sursa (job #2704619) | Cod sursa (job #690716) | Cod sursa (job #3277863)
#include <fstream>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
int arr[1000001];
pair<int, int> findMajority(int arr[], int n)
{
int i, candidate = -1, votes = 0;
for (i = 0; i < n; i++)
{
if (votes == 0)
{
candidate = arr[i];
votes = 1;
}
else
{
if (arr[i] == candidate)
votes++;
else
votes--;
}
}
int count = 0;
for (i = 0; i < n; i++)
{
if (arr[i] == candidate)
count++;
}
if (count > n / 2)
return {candidate, count};
return {-1, 0};
}
int main()
{
int n = 0;
cin >> n;
for(int i=0; i<n; i++)
{
cin >> arr[i];
}
pair<int, int> majority = findMajority(arr, n);
if(majority.first == -1)
cout << -1;
else
cout << majority.first << " " << majority.second;
return 0;
}