难度:2
一道比较简单的贪心题,最后的结果有一个应该是超int了,所以把能换的全换成longlong了,
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;
const int N = 10005;
int main() {
ll n, s;
cin >> n >> s;
ll cost[N];
fill(cost, cost + N, 0x7fffffff);
ll ans = 0;
for (int i = 0; i < n; i++) {
ll a, b;
cin >> a >> b;
cost[i] = min(cost[i], a);
for (int j = i + 1; j < n; j++) {
cost[j] = min(cost[j], a + (j - i ) * s);
}
ans += cost[i] * b;
}
cout << ans;
return 0;
}