Problem p01315 (C++) — buggy submission, verdict: Runtime Error

#include <bits/stdc++.h>
using namespace std;

typedef ostringstream OSS;
typedef istringstream ISS;
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL> VVVLL;
typedef vector<double> VD;
typedef vector<VD> VVD;
typedef vector<VVD> VVVD;
typedef vector<string> VS;
typedef vector<VS> VVS;
typedef vector<VVS> VVVS;
typedef vector<bool> VB;
typedef vector<VB> VVB;
typedef vector<VVB> VVVB;
typedef vector<PII> VPII;
typedef vector<VPII> VVPII;
typedef vector<VVPII> VVVPII;
typedef vector<PLL> VPLL;
typedef vector<VPLL> VVPLL;
typedef vector<VVPLL> VVVPLL;

typedef unsigned int UI;
typedef vector<UI> VUI;
typedef vector<VUI> VVUI;

#define fst first
#define snd second
// #define Y first
// #define X second
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define RANGEBOX(x, y, maxX, maxY)                                             \\
  (0 <= (x) && 0 <= (y) && (x) < (maxX) && (y) < (maxY))
#define RANGE(x, l, r) ((l) <= (x) && (x) <= (r))
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
#define rrep(i, N) for (int i = N - 1; i >= 0; i--)
#define REP(i, init, N) for (int i = (init); i < (int)(N); i++)
#define RREP(i, N, last) for (int i = (init - 1); i >= last; i--)
#define MAXUD(orig, target) orig = max(orig, target)
#define MINUD(orig, target) orig = min(orig, target)
#define DUMP(x) cerr << #x << " = " << (x) << endl

template <typename T> inline T fromString(const string &s) {
  T res;
  ISS iss(s);
  iss >> res;
  return res;
};
template <typename T> inline string toString(const T &a) {
  OSS oss;
  oss << a;
  return oss.str();
};

template <typename T = int> inline void dump(vector<T> vs, bool ent = false) {
  rep(i, vs.size()) cout << vs[i] << (i + 1 == vs.size() ? '\\n' : ' ');
  if (ent)
    cout << endl;
}
template <typename T = int>
inline void dump(vector<vector<T>> vs, bool ent = false) {
  rep(i, vs.size()) dump<T>(vs[i]);
  if (ent)
    cout << endl;
}

const int INF = 0x3f3f3f3f;
const LL INFL = 0x3f3f3f3f3f3f3f3fLL;
const double DINF = 0x3f3f3f3f;
const int DX[] = {1, 0, -1, 0};
const int DY[] = {0, -1, 0, 1};
const double EPS = 1e-12;
// const double PI   = acos(-1.0);
// lambda: [](T1 x)->T2{return y;}
// simple lambda: [](T x){return x;}

void solve(int n) {
  VS names(n);
  VI ps(n);
  VI ts1(n);
  VI ts2(n);
  VI fs(n);
  VI ss(n);
  VI ms(n);

  rep(i, n) {
    cin >> names[i] >> ps[i];
    VI as(5);
    rep(j, 5) cin >> as[j];
    ts1[i] = accumulate(ALL(as), 0);
    ts2[i] = as[3] + as[4];
    cin >> fs[i] >> ss[i] >> ms[i];
  }

  VD scores(n);
  rep(i, n) {
    scores[i] =
        1. * (fs[i] * ms[i] * ss[i] - ps[i]) / (ts1[i] + (ms[i] - 1) * ts2[i]);
  }

  vector<pair<double, string>> xs(n);
  rep(i, n) xs[i] = MP(scores[i], names[i]);
  sort(ALL(xs), [](pair<double, string> a, pair<double, string> b) {
    if (abs(a.fst - b.fst) > EPS)
      return a.fst > b.fst;
    return a.snd < b.snd;
  });

  for (auto x : xs)
    cout << x.snd << endl;
  cout << "#" << endl;
}

int main(void) {
  int n;
  while (cin >> n, n)
    solve(n);

  return 0;
}

Error: WA

Fixed submission:

#include <bits/stdc++.h>
using namespace std;

typedef ostringstream OSS;
typedef istringstream ISS;
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL> VVVLL;
typedef vector<double> VD;
typedef vector<VD> VVD;
typedef vector<VVD> VVVD;
typedef vector<string> VS;
typedef vector<VS> VVS;
typedef vector<VVS> VVVS;
typedef vector<bool> VB;
typedef vector<VB> VVB;
typedef vector<VVB> VVVB;
typedef vector<PII> VPII;
typedef vector<VPII> VVPII;
typedef vector<VVPII> VVVPII;
typedef vector<PLL> VPLL;
typedef vector<VPLL> VVPLL;
typedef vector<VVPLL> VVVPLL;

typedef unsigned int UI;
typedef vector<UI> VUI;
typedef vector<VUI> VVUI;

#define fst first
#define snd second
// #define Y first
// #define X second
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define RANGEBOX(x, y, maxX, maxY)                                             \\
  (0 <= (x) && 0 <= (y) && (x) < (maxX) && (y) < (maxY))
#define RANGE(x, l, r) ((l) <= (x) && (x) <= (r))
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
#define rrep(i, N) for (int i = N - 1; i >= 0; i--)
#define REP(i, init, N) for (int i = (init); i < (int)(N); i++)
#define RREP(i, N, last) for (int i = (init - 1); i >= last; i--)
#define MAXUD(orig, target) orig = max(orig, target)
#define MINUD(orig, target) orig = min(orig, target)
#define DUMP(x) cerr << #x << " = " << (x) << endl

template <typename T> inline T fromString(const string &s) {
  T res;
  ISS iss(s);
  iss >> res;
  return res;
};
template <typename T> inline string toString(const T &a) {
  OSS oss;
  oss << a;
  return oss.str();
};

template <typename T = int> inline void dump(vector<T> vs, bool ent = false) {
  rep(i, vs.size()) cout << vs[i] << (i + 1 == vs.size() ? '\\n' : ' ');
  if (ent)
    cout << endl;
}
template <typename T = int>
inline void dump(vector<vector<T>> vs, bool ent = false) {
  rep(i, vs.size()) dump<T>(vs[i]);
  if (ent)
    cout << endl;
}

const int INF = 0x3f3f3f3f;
const LL INFL = 0x3f3f3f3f3f3f3f3fLL;
const double DINF = 0x3f3f3f3f;
const int DX[] = {1, 0, -1, 0};
const int DY[] = {0, -1, 0, 1};
const double EPS = 1e-12;
// const double PI   = acos(-1.0);
// lambda: [](T1 x)->T2{return y;}
// simple lambda: [](T x){return x;}

void solve(int n) {
  VS names(n);
  VI ps(n);
  VI ts(n);
  VI fs(n);
  VI ss(n);
  VI ms(n);

  rep(i, n) {
    cin >> names[i] >> ps[i];
    VI as(5);
    rep(j, 5) cin >> as[i];
    ts[i] = accumulate(ALL(as), 0);
    cin >> fs[i] >> ss[i] >> ms[i];
  }

  VD scores(n);
  rep(i, n) {
    scores[i] = 1. * (fs[i] * ms[i] * ss[i] - ps[i]) / (ts[i] * ms[i]);
  }

  vector<pair<double, string>> xs(n);
  rep(i, n) xs[i] = MP(scores[i], names[i]);
  sort(ALL(xs), [](pair<double, string> a, pair<double, string> b) {
    if (abs(a.fst - b.fst) > EPS)
      return a.fst > b.fst;
    return a.snd < b.snd;
  });

  for (auto x : xs)
    cout << x.snd << endl;
}

int main(void) {
  int n;
  while (cin >> n, n)
    solve(n);

  return 0;
}