Cod sursa(job #3198009)
Utilizator | Data | 27 ianuarie 2024 22:44:47 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int v[1000001];
int main()
{
int n;
in>>n;
for(int i=1; i<=n; i++)
{
in>>v[i];
}
int cnt=1, candidat=v[1];
for(int i=1; i<n; i+=1)
{
if(v[i]!=candidat)
{
cnt=cnt-1;
if(cnt==0)
{
cnt=1;
candidat=v[i];
}
}
else
cnt++;
}
cnt=0;
for(int i=1; i<=n; i++)
{
if(v[i]==candidat)
cnt++;
}
out<<candidat<<' '<<cnt;
}