Submission #351369

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;

typedef long long ll;
typedef pair<ll,ll> P;

ll mod = 1000000007;

ll N;
ll T[10020];

ll pw[10020];

vector<P> vp;

ll cost() {
  ll now = 0;
  ll cost_ = 0;
  for (int i = 0; i < N; i++)
  {
    now += T[i];
    cost_ += now;
  }
  return cost_;
}

ll pattern() {
  ll ret = 1;
  for (int i = 0; i < vp.size(); i++)
  {
    ll cnt = vp[i].second;
    ret = ret * pw[cnt] % mod;
  }

  return ret;
}

int main()
{
  ll bs = 1;
  for (ll i = 1; i <= 10000; i++)
  {
    bs = (bs * i) % mod;
    pw[i] = bs;
  }

  while (cin >> N)
  {
    for (int i = 0; i < N; i++)
    {
      cin >> T[i];
    }

    sort(T, T+N);

    vp.clear();
    ll base = -1, cnt = 0;
    for (int i = 0; i < N; i++)
    {
      if (base != T[i])
      {
        if (cnt)
        {
          vp.push_back(P(base, cnt));
          cnt = 0;
        }
        base = T[i];
      }
      ++cnt;
    }

    if (cnt) {
      vp.push_back(P(base, cnt));
    }

    cout << cost() << endl;
    cout << pattern() << endl;

  }

  return 0;
}

Submission Info

Judge Result