A. LLPS

 

题意：找到s中字典序最大字母的组成的回文字符串 

思路：反向map存储输出即可

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define fir first
#define sec second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
int ans, cnt, m, n ,t ,k;
int mod=1e9+7;
const int N = 1e7;
//int a[N];
//int b[N],dp[2000][2000];
string s,ss,str;
int read(){
    int x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
    while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
    return x*f;
}
void solve(){
}
int main() {
    // int t = 1;cin >> t;while (t--){solve();}
    cin>>s;
    map<char,int,greater<char>>mp;
    for(auto enge:s)++mp[enge];
    for(auto [k,v]:mp){
        string ss(v,k);
        cout<<ss;
        return 0;
    }
    return 0;
}