Cod sursa(job #3292782)
| Utilizator | Data | 9 aprilie 2025 12:43:55 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
const int NMAX=1000000;
int v[NMAX+1];
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int main()
{
int N,cnt=0,cr=-1;
f >> N;
for(int i=1;i<=N;i++){
f >> v[i];
if(cnt==0){
cr=v[i];
cnt=1;
}else if(cr==v[i]) cnt++;
else cnt--;
}
//
if(cnt==0) g << -1;
else{
cnt=0;
for(int i=1;i<=N;i++)
if(v[i]==cr) cnt++;
if(cnt>N/2) g << cr << ' ' << cnt;
else g << -1;
}
f.close();
g.close();
return 0;
}
