Cod sursa(job #3277843)
| Utilizator | Data | 17 februarie 2025 15:19:35 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#include <iomanip>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int v[1000009];
int main ()
{
int n;
f >> n;
for (int i=1; i<=n; i++)
f >> v[i];
int candidat=0, k=0;
for (int i=1; i<=n; i++)
{
if (!k) candidat=v[i];
else
{
if (v[i]==candidat) k++;
else k--;
}
}
int nr=0;
for (int i=1; i<=n; i++)
if (v[i]==candidat) nr++;
if (nr>n/2) g << candidat << ' ' <<nr;
else g<<-1;
}
