Pagini recente » Cod sursa (job #1639855) | Cod sursa (job #1803985) | Cod sursa (job #708965) | Cod sursa (job #2453201) | Cod sursa (job #2184067)
#include <iostream>
#include <fstream> // 1 2 2 3 2 2 2 4 2 4 2 4
using namespace std;
int a[1000005], cnt =0;
int main()
{
int n, szam, major = 0, db = 0;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
//cin >> n;
f >> n;
while(n)
{
f>> a[cnt];
szam = a[cnt];
cnt++;
if(db == 0)
{
major = szam;
db = 1;
}
else if(major == szam)
db++;
else
db--;
n--;
}
db = 0;
for(int i=0; i<cnt; i++)
{
szam = a[i];
if(szam == major)
db++;
}
if(db > n/2)
{
//cout << major;
g << major <<' '<< db;
}
else
{
//cout << -1;
g << -1;
}
g << '\n';
return 0;
}