Cod sursa(job #2244582)
| Utilizator | Data | 23 septembrie 2018 10:19:51 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
const int N = 1000010;
int n,i,maj,cnt,v[N];
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i];
if(cnt)
{
if(v[i]==maj)
cnt++;
else
cnt--;
}
else
{
maj=v[i];
cnt=1;
}
}
cnt=0;
for(i=1;i<=n;i++)
if(v[i]==maj)
cnt++;
if(cnt>n-cnt)
g<<maj<<' '<<cnt;
else
g<<-1;
return 0;
}
