Pagini recente » Cod sursa (job #131086) | Cod sursa (job #1280221) | Cod sursa (job #46529) | Cod sursa (job #2439350) | Cod sursa (job #1162348)
#include <iostream>
#include <fstream>
using namespace std;
long long n,a[2000000];int i,j,adat;
int bruteForceMajority(int n){
for (int i = 0; i < n; i++) {
int nr = 0;
for (int j = 0; j < n; j++) {
if (a[j]==a[i])
nr++;
}
if (nr > n / 2)
{adat=nr;return a[i];}
}
return -1;
}
void citire(){
ifstream fin("elmaj.in");
fin>>n;
for(int i=0;i<n;i++) fin>> a[i];
fin.close();
}
int main()
{
citire();
int x=0;
x=bruteForceMajority(n);
ofstream g("elmaj.out");
g<<x<<" "<<adat;
g.close();
return 0;
}