Problem:
Score : 200 points

Problem Statement

Kurohashi has never participated in AtCoder Beginner Contest (ABC).

The next ABC to be held is ABC N (the N-th ABC ever held).
Kurohashi wants to make his debut in some ABC x such that all the digits of x in base ten are the same.

What is the earliest ABC where Kurohashi can make his debut?

Constraints

100 \leq N \leq 999

N is an integer.

Input

Input is given from Standard Input in the following format:

N

Output

If the earliest ABC where Kurohashi can make his debut is ABC n, print n.

Sample Input 1

111

Sample Output 1

111

The next ABC to be held is ABC 111, where Kurohashi can make his debut.

Sample Input 2

112

Sample Output 2

222

The next ABC to be held is ABC 112, which means Kurohashi can no longer participate in ABC 111.
Among the ABCs where Kurohashi can make his debut, the earliest one is ABC 222.

Sample Input 3

750

Sample Output 3

777

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<bits/stdc++.h>
using namespace std;


struct node
{
	 int c;
	 int num;
	 
};
struct node a[100005],b[100005];

bool cmp(node a,node b)
{
	 return a.c>b.c;
}
int main()
{for(int i=0;i<100005;i++)
{
	a[i].c=0;
	a[i].num=i;
	b[i].c=0;
	b[i].num=i;
}
	 int n;
	 cin>>n;
	  int jd=0,od=0,jx=1000000000,ox=1000000000;
	 vector<int>j,o;
	 int jmax=0,jmaxn=0,omax=0,omaxn=0;
	 for(int i=1;i<=n;i++)
	 {int t;
	 cin>>t;
	 
	 	if(i&1)
	 	{
	 	    j.push_back(t);
	 	    jd=max(jd,t);
	 	    jx=min(jx,t);
	 	    a[t].c++;
	 	  
	 	    if(a[t].c>jmax)
	 	    {
	 	    	jmax=a[t].c;
	 	    	jmaxn=t;
			 }
		 }
		 else
		 {   
		 	o.push_back(t);
		 	od=max(od,t);
		 	ox=min(ox,t);
		 	b[t].c++;
		 	if(b[t].c>omax)
	 	    {
	 	    	omax=b[t].c;
	 	    	omaxn=t;
			 }
		 }
	 	
	 }
	 if(jd==od&&jx==ox&&jd==jx)
	    {
	    	cout<<j.size()<<endl;
	    	return 0;
		}
	 sort(a,a+100005,cmp);
	 	 sort(b,b+100005,cmp);
	 	
	
	
	/* jd=max_element(j.begin(),j.end());
	  od=max_element(o.begin(),o.end());
	   jx=min_element(j.begin(),j.end());
	    ox=min_element(o.begin(),o.end());*/
	    
	    int jc=0,oc=0;
	    if(jmaxn==omaxn)
	    {
	    	jmaxn=a[1].num;
		}
	    for(int i=0;i<j.size();i++)
	    {
	    	if(jmaxn!=j[i])
	    	{
	    		jc++;
	    		j[i]=jmaxn;
			}
		}
		
		  for(int i=0;i<o.size();i++)
	    {
	    	if(omaxn!=o[i])
	    	{
	    		oc++;
	    		o[i]=omaxn;
			}
		}
		cout<<jc+oc<<endl;
}