QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#543772#6691. OrdersmmzskmWA 0ms3756kbC++17858b2024-09-01 19:55:452024-09-01 19:55:45

Judging History

你现在查看的是最新测评结果

  • [2024-09-01 19:55:45]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3756kb
  • [2024-09-01 19:55:45]
  • 提交

answer

#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
using namespace std;

#define int long long

const int mxn = 1e6 + 5;

typedef pair<int, int> pii;

void solve()
{
    int n, k;
    scanf("%lld%lld", &n, &k);
    vector<pii> v(n + 1);
    v[0] = { 0,0 };
    for (int i = 1; i <= n; i++)
    {
        cin >> v[i].first >> v[i].second;
    }
    sort(v.begin(), v.end());
    int sum = 0;
    for (int i = 1; i <= n; i++)
    {
        sum += k * (v[i].first - v[i - 1].first);
        sum -= v[i].second;
        if (sum < 0)
        {
            printf("No\n");
            return;
        }
    }
    printf("Yes\n");
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    int T = 1;
    scanf("%lld", &T);
    while (T--)
    {
        solve();
    }

    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 3756kb

input:

2
4 5
6 12
1 3
6 15
8 1
3 100
3 200
4 300
6 100

output:

Yes
Yes

result:

wrong answer expected NO, found YES [2nd token]