Codeforces 1890D- Doremy‘s Connecting Plan(906 div2-思维/数学/贪心 补)

题目链接：https://codeforces.com/contest/1890/problem/D

题目大意和思路： 参考这里

#pragma GCC optimize(2)
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define endy {cout<<"Yes\n";}//return ;}❤
#define endn {cout<<"No\n";}//return ;}❤
#define endl '\n'
#define fr first
#define sc second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef pair<ll,ll> pii;
const int mod = 1e9+7;
const int N = 2e5+10;
const ll INF_ = 0x3f3f3f3f3f3f3f3f;
const int INF = 0x3f3f3f3f;
ll n, m, k, x, y, res = 0, sum = 0, ans = 0, ma = 0, mi = INF;
ll c;
void solve()
{
    cin >> n >> c >> x;
    vector<pii> vp;
    for (int i = 2; i <= n; i++) {
        cin >> y;
        vp.push_back({ y, i });
    }
    sort(vp.begin(), vp.end(), [](const pii& a, const pii& b) {
        return a.fr - a.sc * c > b.fr - b.sc * c;
    });
    bool ok = true;
    for (auto y : vp) {
        if (x + y.fr < y.sc * c) {
            ok = false;
            break;
        }
        x += y.fr;
    }
    if (ok) endy else endn
}
int main()
{
	ios::sync_with_stdio(0);cin.tie(0);
	// cout.tie(0);
	ll _;cin>>_;
	while(_--)
		solve();
	return 0;
}