Cod sursa(job #3287380)
Utilizator | Data | 17 martie 2025 18:09:22 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int arr[100001];
int main()
{
int n,cnt=0;
int contor=1;
int act=0;
in>>n;
for(int i=1; i<=n; i++)
{
in>>arr[i];
if(arr[i]==act)
{
contor++;
}
else
{
contor--;
}
if(contor==0)
{
act=arr[i];
contor=2;
}
}
for(int i=1;i<=n;i++){
if(arr[i]==act){
cnt++;
}
}
out<<act<<" "<<cnt;
return 0;
}