Cod sursa(job #3373916)
| Utilizator | Data | 8 noiembrie 2026 10:32:09 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.76 kb |
#include <fstream>
using namespace std;
const int maxn = 1000005;
int a[maxn];
int main()
{
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
int n;
cin >> n;
int candidate = 0, cnt = 0;
for (int i = 0; i < n; i++)
{
cin >> a[i];
if (cnt == 0)
{
candidate = a[i];
cnt = 1;
}
else if (a[i] == candidate)
{
cnt++;
}
else
{
cnt--;
}
}
cnt = 0;
for (int i = 0; i < n; i++)
{
if (a[i] == candidate) {cnt++;}
}
if (cnt > n / 2)
{
cout << candidate << ' ' << cnt;
}
else
{
cout << -1;
}
}
