Submission #3780791

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define FORR(i, m, n) for(int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long long
#define pb(a) push_back(a)

ll mod = 1e9 + 7;

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  ll n, x;
  cin >> n >> x;

  ll a[n], s[n];
  REP(i, n){
    cin >> a[i];
    s[i] = a[i];
  }

  ll ans = 1e15, rec;
  REP(i, n){
    rec = i * x;
    REP(j, n){
      s[j] = min(s[j], a[(j - i + n) % n]);
      rec += s[j];
    }
    ans = min(ans, rec);
  }

  cout << ans << endl;

  return 0;
}

Submission Info

Judge Result