Submission #72574812

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <cstdint>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <fstream>
#include <cmath>
#include <limits>
#include <chrono>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
#include <cassert>
#include <random>
#include <bit>
#include <cstdint>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, l, r) for (ll i = (l); i < (r); ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using pl = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using mint=modint998244353;


int main(){
    ll n;
    cin>>n;
    vector<pair<ll,string>> s(n);
    rep(i,0,n){
        cin>>s[i].second;
        s[i].first=s[i].second.size();
    }
    sort(all(s));
    reverse(all(s));
    rep(i,0,n){
        s[i].second[0]-=32;
        cout<<s[i].second[0];
    }
    cout<<endl;
    return 0;
}

Submission Info

Judge Result