Submission #1691925

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;

ll N, X, A[2000];

int main(void) {
  cin >> N >> X;
  REP(i, 0, N) cin >> A[i];

  vector<pll> vec(N);
  REP(i, 0, N) vec[i] = pll(A[i], N - i);
  sort(vec.begin(), vec.end());

  vector<bool> used(N, false);
  ll ans = (1LL << 60);
  REP(i, 0, N) {
    used[N - vec[i].second] = true;
    ll last, sum = 0, cnt = 0, cntmax = 0;
    REP(j, 0, N) {
      ll idx = (N - vec[i].second + j) % N;
      if(used[idx]) {
        sum += A[idx];
        last = idx;
        cnt = 0;
      } else {
        sum += A[last];
        cnt++;
      }
      cntmax = max(cnt, cntmax);
    }
    sum += X * cntmax;
    ans = min(ans, sum);
  }
  cout << ans << endl;
}

Submission Info

Judge Result