Problem Solving/백준
단어 공부
높은곳에영광
2022. 1. 16. 23:50
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
vector<int> arr('Z'+1);
for(int i = 0; i < str.length(); i++) {
arr[toupper(str[i])]++;
}
auto temp = max_element(arr.begin(), arr.end());
int cnt = 0;
for(int i = 0; i < arr.size(); i++) {
if(arr[i] == *temp) cnt++;
if(cnt > 1) {
cout << "?";
exit(0);
}
}
cout << (char)(distance(arr.begin(), max_element(arr.begin(), arr.end())));
}