Cod sursa(job #3344068)
| Utilizator | Data | 1 martie 2026 11:58:15 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n, a[1000005], i, k, cand, nr;
int main()
{
fin>>n;
for(i=1; i<=n; i++)
fin>>a[i];
int cand=-1;
for(i=1; i<=n; i++)
{
if(k==0)
{
cand=a[i];
k++;
}
else
if(a[i]==cand)
k++;
else
k--;
}
for(i=1; i<=n; i++)
if(cand==a[i])
nr++;
if(nr>n/2)
fout<<cand<<" "<<nr;
else
fout<<-1;
return 0;
}
