A. Love "A"

time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Alice has a string s. She really likes the letter “a”. She calls a string good if strictly more than half of the characters in that string are "a"s. For example “aaabb”, “axaa” are good strings, and “baca”, “awwwa”, “” (empty string) are not.

Alice can erase some characters from her string s. She would like to know what is the longest string remaining after erasing some characters (possibly zero) to get a good string. It is guaranteed that the string has at least one “a” in it, so the answer always exists.

Input
The first line contains a string s (1≤|s|≤50) consisting of lowercase English letters. It is guaranteed that there is at least one “a” in s.

Output
Print a single integer, the length of the longest good string that Alice can get after erasing some characters from s.

Examples
inputCopy
xaxxxxa
outputCopy
3
inputCopy
aaabaa
outputCopy
6
Note
In the first example, it’s enough to erase any four of the "x"s. The answer is 3 since that is the maximum number of characters that can remain.

In the second example, we don’t need to erase any characters.

题目思路：水题，判断a的数量和字符串长度的关系

#include<cstdio>
#include<cmath>
#include<cstring>
#include<ctime>
#include<iostream>
#include<algorithm>
#include<map>
#include<stack>
#include<string>
#include<queue>
#include<vector>
#include<set>
#include<windows.h>
#define ll long long
#define dd double
using namespace std;

struct node {
	dd y, x;
}S[1000000];

int main() {
	string ss;
	while (cin >> ss) {
		ll count = 0;
		for (ll i = 0; i < ss.size(); i++) {
			if (ss[i] == 'a') {
				count++;
			}
		}
		if (ss.size() % 2 == 0) {
			if (count > ss.size() / 2) {
				cout << ss.size() << endl;
			}
			else {
				cout << (count + count - 1) << endl;
			}
		}
		else {
			if (count > ss.size() / 2) {
				cout << ss.size() << endl;
			}
			else {
				cout << (count + count - 1) << endl;
			}
		}
	}
}