Cod sursa(job #2093496)
| Utilizator | Data | 23 decembrie 2017 20:33:44 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include<fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int a[1000001],n,i,j,maj=-1,contor=0;
int main()
{
f>>n;
maj=-1;
for(i=1;i<=n;i++)
{
f>>a[i];
if(a[i]==maj)
contor++;
else
contor--;
if(contor<=0)
{maj=a[i];
contor=1;
}
}
contor=0;
for(i=1;i<=n;i++)
if(a[i]==maj)
contor++;
if(contor>=(n/2+1))
g<<maj<<" "<<contor;
else
g<<"-1";
return 0;
}
