Pagini recente » Cod sursa (job #2925466) | Cod sursa (job #6838) | Cod sursa (job #2488497) | Cod sursa (job #1036929) | Cod sursa (job #1523503)
#include <iostream>
#include <fstream>
using namespace std;
const int maxn = 1000005;
int v[maxn];
int main()
{
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int n;
in >> n;
int candidat = 0;
int fr = 0;
for(int i = 1; i <= n; i++)
{
in >> v[i];
if(fr == 0)
{
candidat = v[i];
fr = 0;
}
if(candidat == v[i])
fr++;
else
fr--;
}
out << candidat << " ";
in >> n;
int nr = 0;
for(int i = 1; i <= n; i++)
if(v[i] == candidat)
nr++;
out << nr << "\n";
return 0;
}