Cod sursa(job #1778230)
| Utilizator | Data | 13 octombrie 2016 17:10:10 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
stack<int> S;
int n;
int* a;
int main()
{
fin>>n;
a = new int [n];
for(int i=0;i<n;i+=1){
fin>>a[i];
while(S.size()&&S.top()!=a[i])
S.pop();
S.push(a[i]);
}
int elmaj=S.top();
int cnt=0;
for(int i=0;i<n;i+=1){
if(a[i]==elmaj)
cnt+=1;
}
if(cnt>=(n/2+1))
fout<<elmaj<<' '<<cnt;
else
fout<<-1;
fin.close();
fout.close();
return 0;
}
