Submission #1695438

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
  ll n,x;
  cin >> n >> x;
  vector<ll> a(n), v(n);
  for(int i=0;i<n;i++) {
    cin >> a[i];
    v[i] = a[i];
  }

  ll ans = 1e9 * 2100;
  for(int k=0;k<n;k++) {
    ll k_ans = 0;
    for(int i=0;i<n;i++) {
      if(i-k < 0) {
        v[i] = min<ll>(v[i], a[n+i-k]);
      } else {
        v[i] = min<ll>(v[i], a[i-k]);
      }

      k_ans += v[i];
    }
    ans = min<ll>(ans, k_ans + k * x);
  }
  cout << ans << endl;


}

Submission Info

Judge Result