Cod sursa(job #1060973)
| Utilizator | Data | 18 decembrie 2013 22:57:15 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.57 kb |
#include<fstream>
#define maxn 1000006
using namespace std;
ifstream fi("elmaj.in");
ofstream fo("elmaj.out");
int a[maxn],i,n,nr,maj;
int main(void){
fi>>n;
for(i=1;i<=n;i++) fi>>a[i];
nr=1; maj=a[1];
for(i=2;i<=n;i++)
if (a[i]==maj) nr++;
else {
nr--;
if (nr<0) { nr=1; maj=a[i]; }
}
nr=0;
for(i=1;i<=n;i++) if (a[i]==maj) nr++;
if (nr<(n/2)+1) fo<<"-1";
else fo<<maj<<" "<<nr;
fi.close();
fo.close();
return 0;
}
