Pagini recente » Cod sursa (job #283832) | Cod sursa (job #667539) | Cod sursa (job #597531) | Cod sursa (job #1356101) | Cod sursa (job #3195549)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int arr[1000001];
int main(){
int n;
fin>>n;
for(int i=1;i<=n;i++){
fin>>arr[i];
}
int el_majoritar=arr[1], scor=1;
for(int i=2;i<=n;i++){
if(scor==0){
el_majoritar=arr[i];
}
if(arr[i]!=el_majoritar){
scor--;
}else{
scor++;
}
}
int nr_aparitii=0;
for(int i=1;i<=n;i++){
if(arr[i]==el_majoritar){
nr_aparitii++;
}
}
if(nr_aparitii>n/2){
fout<<el_majoritar<<" "<<nr_aparitii;
}
return 0;
}