Submission #1534001

---

Source Code Expand

#include<bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
#define allsort(v) sort(v.begin(),v.end())
#define allsortg(v)sort(v.begin(),v.end(),greater<int>());
const ll mod = 1e9 + 7;
const ll INF = 1e15;

int main() {
	cin.sync_with_stdio(false);
	ll N, x;
	cin >> N >> x;
	vector<int>a(N);
	vector<int>mint(N);
	rep(i, N) {
		cin >> a[i];
		mint[i] = a[i];
	}
	ll ans = INF;
	
	rep(i, N) {
		ll t = x*i;
		rep(j, N) {
			mint[j] = min(mint[j], a[(j - i >= 0 ? j - i : N + j - i)]);
			t += mint[j];
		}
		ans = min(ans, t);
	}
	cout << ans << endl;
	
	return 0;
}

Submission Info

Judge Result