Pagini recente » Cod sursa (job #2201379) | Cod sursa (job #2275545) | Cod sursa (job #2011713) | Cod sursa (job #1605046) | Cod sursa (job #2555092)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f ("elmaj.in");
ofstream g ("elmaj.out");
int n,v[1000010],i,j,majoritar,nr=1;
int main()
{
f >> n;
f >> v[1];
majoritar=v[1];
for(i=2; i<=n; i++) {
f >> v[i];
if(majoritar==v[i]) nr++;
else nr--;
if(nr==0) {
majoritar=v[i];
nr=1;
}
}
nr=0;
for(i=1; i<=n; i++) if(v[i]==majoritar) nr++;
if(nr>n/2) g << majoritar << " " << nr;
return 0;
}