Pagini recente » Cod sursa (job #2407032) | Cod sursa (job #1572400) | Cod sursa (job #2948538) | Cod sursa (job #2679413) | Cod sursa (job #1331125)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
long long v[100000009];
int main()
{
long long n,i,m,ma,fr=1;
f>>n;
for (i=1;i<=n;i++){
f>>v[i];
}
ma=v[1];
for (i=2;i<=n;i++)
{
if (fr==0) {ma=v[i];fr=1;}
if (v[i]==v[i-1]) {fr++;}
else fr--;
}
fr=0;
for (i=1;i<=n;i++)
{
if (ma==v[i]) fr++;
}
if (n/2<fr) g<<ma<<" "<<fr;
else g<<"-1";
return 0;
}