Pagini recente » Cod sursa (job #1004269) | Cod sursa (job #2416051) | Cod sursa (job #1814447) | Cod sursa (job #2523995) | Cod sursa (job #1405153)
#include <fstream>
#include <vector>
using namespace std;
ifstream is("elmaj.in");
ofstream os("elmaj.out");
int n;
int a[100002];
int nr = -1;
int k = 0;
int main()
{
is >> n;
for(int i = 0; i < n; ++i)
is >> a[i];
for(int i = 0; i < n; ++i)
{
if( k == 0)
{
nr = a[i];
k = 1;
}
else
{
if(a[i] == nr)
k++;
else
k--;
}
}
if(nr < 0)
os << -1;
else
{
int cnt = 0;
for(int i = 0; i < n; ++i)
{
if(a[i] == nr)
cnt++;
}
if(cnt > n/2)
os << nr << ' ' << cnt;
else
os << -1;
}
is.close();
os.close();
return 0;
}