Submission #11585179

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <vector>
#include <utility>

int main(){
  int N;
  std::vector<std::pair<char, int>> balls;
  
  std::cin >> N;
  balls.reserve(N);
  
  std::generate_n(std::back_inserter(balls),
                  N,
                  []{
                    std::pair<char, int> tmp;
                    std::cin >> tmp.second >> tmp.first;
                    return tmp;
                  });
  
  std::sort(balls.begin(), balls.end(),
            [](auto const& lhs, auto const& rhs){
              return lhs.first > rhs.first || (lhs.first == rhs.first && lhs.second < rhs.second);
            });
  
  for (auto const& ball : balls) {
    std::cout << ball.second << std::endl;
  }
}

Submission Info

Judge Result