Submission #1355011

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
int N;
ll x;
ll a[2001];
ll ma[2001];
ll ans = 1e18;
int main() {
  cin >> N >> x;

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

  for(int i = 0; i < N; i++) {
    ll b = 0;
    int k;
    for(int j = 0; j < N; j++) {
       k = j - i - 1;
      b += ma[j];
      if(k < 0) k += N;
      ma[j] = min(ma[j],a[k]);
      //cout <<"ma["<<j<<"] = "<<ma[j]<<endl;
    }
    ans = min(ans,(ll)i*x+b);
  }

  cout << ans <<endl;
}
      
      
    
  

Submission Info

Judge Result