Pagini recente » Cod sursa (job #2091657) | Cod sursa (job #685624) | Cod sursa (job #2446824) | Cod sursa (job #471766) | Cod sursa (job #1127548)
#include <fstream>
using namespace std;
int a[1000000],b[1000000],n,co,i,j,c,ok,nb;
int main ()
{
ifstream f("elmaj.in");
ofstream g("elmaj.out");
//Citire
f>>n;
for(i=1;i<=n;i++)
{
f>>a[i];
}
//Prelucrare
nb=0;
ok=0;
for(i=1;i<=n;i++)
{
c=0;
for(j=1;j<=nb;j++)
{
if (a[i]==b[j])
{
c++;
}
}
if(c==0)
{
co=1;
for(j=i+1;j<=n;j++)
{
if(a[i]==a[j])
{
co++;
}
}
if(co>n/2)
{
ok=1;
break;
}
nb++;
b[nb]=a[i];
}
}
if(ok==0)g<<-1;
else g<<a[i]<<" "<<co;
g.close();
f.close();
return 0;
}