Cod sursa(job #2680944)
Utilizator | Robert Gaspar Darkwarrior | Data | 4 decembrie 2020 17:28:59 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int main()
{
int a[1000005],n,Count=1;
f>>n>>a[0];
int maj=a[0];
int cnt=0;
for(int i=1;i<n;i++){
f>>a[i];
if(a[i]==maj)
Count++;
else Count--;
if(Count==0){
maj=a[i];
Count=1;}
}
for(int i=0;i<n;i++)
if(a[i]==maj)cnt++;
g<<maj<<" "<<cnt;
return 0;
}