Pagini recente » Cod sursa (job #1102381) | Cod sursa (job #523276) | Cod sursa (job #804081) | Cod sursa (job #2773696) | Cod sursa (job #1971911)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
long v[1000001], major;
int n, i, j, nr;
long majoritar()
{
for(j=1; j<=n; j++)
{
nr=0;
for(i=1; i<=n; i++)
if(v[j]==v[i])
nr++;
if(nr > n/2)
major = v[j];
}
return major, nr;
}
int main()
{
fin >> n;
for(i=1; i<=n; i++)
fin >> v[i];
majoritar();
fout << major << " " << nr;
fin.close();
return 0;
}