Submission #60738937

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
//型名略称系
using ll = long long;using vi = vector<int>;using vll = vector<ll>;
template <class T>using pqg = priority_queue<T, vector<T>, greater<T>>;  // ascendent
//便利関数系
// a = min(a,b)
template <typename T, typename S>
inline bool chmin(T& a, const S& b) {
  return (a > b ? a = b, 1 : 0);
}
// a = max(a,b)
template <typename T, typename S>
inline bool chmax(T& a, const S& b) {
  return (a < b ? a = b, 1 : 0);
}
string f(int b){
  string s = "";
  for(int j = 0; j< 5; j++)if((1 << j)&b){
      s += char(j+int('A'));
  }
  return s;
}

int main(){
  vector<int> l(5);
  cin >> l[0] >> l[1] >> l[2] >> l[3] >> l[4];
  auto compare = [](pair<int, int> x, pair<int, int> y) -> bool{
  if(x.first != y.first) return x.first < y.first;
  // cerr << f(x.second ) << ' ' << f(y.second) << endl;
  return f(x.second) > f(y.second);
  };
  priority_queue<pair<int, int>, vector<pair<int, int>>, decltype(compare)> m;
  for(int i = 0; i < 32; i++){
    int ans = 0;
    for(int j = 0; j < 5; j++)if((1 << j)&i){
      ans += l[j];
    }
    m.emplace(ans, i);
  }
  while(!m.empty()){
    auto [a, b] = m.top();
    m.pop();
    for(int j = 0; j< 5; j++)if((1 << j)&b){
      cout << char(j+int('A'));
    }
    cout << endl;
  }
  return 0;
}

Submission Info

Judge Result