Anton and currency you all know

原题
Berland, 2016. The exchange rate of currency you all knowagainst the burle has increased so much that to simplify the calculations, its fractional part was neglected and the exchange rate is now assumed to be an integer.Reliable sources have informed the financier Anton of some information about the exchange rate of currency you all know against the burle for tomorrow. Now Anton knows that tomorrow the exchange rate will be an even number, which can be obtained from the present rate by swapping exactly two distinct digits in it. Of all the possible values that meet these conditions, the exchange rate for tomorrow will be the maximum possible. It is guaranteed that today the exchange rate is an odd positive integer n. Help Anton to determine the exchange rate of currency you all know for tomorrow!
Input
The first line contains an odd positive integer n — the exchange rate of currency you all know for today. The length of number n’s representation is within range from 2to 105, inclusive. The representation of n doesn’t contain any leading zeroes.
Output
If the information about tomorrow’s exchange rate is inconsistent, that is, there is no integer that meets the condition, print  - 1.Otherwise, print the exchange rate of currency you all knowagainst the burle for tomorrow. This should be the maximum possible number of those that are even and that are obtained from today’s exchange rate by swapping exactly two digits. Exchange rate representation should not contain leading zeroes
Examples

Input
527
Output
572

Input
4573
Output
3574

Input
1357997531
Output
-1

题意
交换两个数，使其变为偶数且得到的数最大
思路
交换：如果低位的的数大于高位的数，交换后数会变大，反之交换后的数会变小。

末位与尽可能高的“值小于它的高位偶数交换”，使得获益尽量大
如果没有小于它的偶数，那就与尽可能低的低位的偶数交换，使损失尽量小，太贪心了…………

#include<iostream>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;

int a[100005];
int main()
{
  int b;
  int g;cin>>b;
  int bo[105],gr[105];
  bool p[105];
  memset(p,false,sizeof(p));
  for(int i=1;i<=b;i++)
    cin>>bo[i];
    cin>>g;
  for(int i=1;i<=g;i++)
    cin>>gr[i];
  sort(bo+1,bo+1+b);
  sort(gr+1,gr+1+g);
  int all=0;
  for(int i=1;i<=b;i++)
  {
      for(int j=1;j<=g;j++)
      {
          if(bo[i]-gr[j]<=1&&bo[i]-gr[j]>=0&&!p[j])
          {p[j]=1;
             all++;
              break;
          }
          if(bo[i]-gr[j]>=-1&&bo[i]-gr[j]<=0&&!p[j])
          {
              p[j]=1;
              all++;
              break;
          }
          if(gr[j]-bo[i]>=2)
            break;
      }
  }
  cout<<all;
}