Pagini recente » Cod sursa (job #1916856) | Istoria paginii runda/conc1/clasament | Cod sursa (job #2197054) | Cod sursa (job #2414869) | Cod sursa (job #1640745)
#include <fstream>
using namespace std;
ifstream F ("elmaj.in");
ofstream G ("elmaj.out");
int n,i,v[1000004],k=1,maj;
int main()
{
F>>n>>v[1];maj=v[1];
for (i=2;i<=n;i++)
{
F>>v[i];
if (v[i]==v[i-1])
++k;
else
--k;
if (!k)
maj=v[i],
k=1;
}
k=0;
for (i=1;i<=n;i++)
if (maj==v[i])
++k;
if (k >= n/2+1)
G<<maj<<" "<<k;
else
G<<"-1";
return 0;
}