Cod sursa(job #3228459)
Utilizator | Data | 8 mai 2024 12:27:42 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
using namespace std;
ifstream F("elmaj.in");
ofstream G("elmaj.out");
#define Z 2048
int n,i,a[3000000],p=Z,l,k,j;
char s[Z];
inline char A()
{
if(p==Z)
F.read(s,Z),p=0;
return s[p++];
}
int B()
{
int n=0;
char c;
for(c=A();isdigit(c);n=n*10+c-48,c=A());
return n;
}
int main()
{
for(n=B();i<n;a[i]=B(),!k?l=a[i],k=1:a[i]==l?++k:--k,++i);
for(i=0;i<n;j+=a[i++]==l);
return j>n/2?G<<l<<' '<<j:G<<-1,0;
}