Cod sursa(job #3306629)
| Utilizator | Data | 12 august 2025 16:27:06 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.7 kb |
#include <fstream>
#define NMAX 10005
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n,ap,elemaj,nrap;
long long v[NMAX];
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
ap=1;
elemaj=v[1];
for(int i=2;i<=n;i++)
{
if(v[i]==elemaj)
ap++;
else
{
if(ap!=0)
ap--;
else
{
ap=1;
elemaj=v[i];
}
}
}
for(int i=1;i<=n;i++)
{
if(v[i]==elemaj) nrap++;
}
if(nrap>=n/2+1)
fout<<elemaj<<" "<<nrap;
else fout<<-1;
return 0;
}
