BOJ 27522 - 카트라이더: 드리프트 [C++]

문제

링크

풀이

#include <iostream>
#include <vector>
#include <utility>
#include <string>
#include <algorithm>
using namespace std;
 
void solve(void) {
  vector<pair<string, char> > v(8);
  for (int i=0; i<8; i++) cin >> v[i].first >> v[i].second;
  sort(v.begin(), v.end());
 
  int r = 0, b = 0, score;
  for (int i=0; i<8; i++) {
    switch (i) {
      case 0: score = 10; break;
      case 1: score = 8; break;
      case 2: score = 6; break;
      case 3: score = 5; break;
      case 4: score = 4; break;
      case 5: score = 3; break;
      case 6: score = 2; break;
      case 7: score = 1; break;
    }
    if (v[i].second == 'R') r += score;
    else b += score;
  }
  cout << (r > b ? "Red" : "Blue");
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  solve();
  return 0;
}