QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #704990 | #6691. Orders | tacmon | AC ✓ | 1ms | 3844kb | C++14 | 626b | 2024-11-02 21:47:39 | 2024-11-02 21:47:43 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e2 + 2;
int T, N, K, a[maxn], b[maxn];
int per[maxn];
bool cmp(int i, int j) { return a[i] < a[j]; }
void solve() {
scanf("%d%d", &N, &K);
for (int i = 1; i <= N; i++) scanf("%d%d", &a[i], &b[i]);
for (int i = 1; i <= N; i++) per[i] = i;
sort(per + 1, per + N + 1, cmp);
long long sum = 0;
for (int i = 1; i <= N; i++) {
sum = sum + b[per[i]];
if (1LL * a[per[i]] * K < sum) {
puts("No");
return;
}
}
puts("Yes");
}
int main() {
scanf("%d", &T);
while(T--) solve();
return 0;
}
这程序好像有点Bug，我给组数据试试？
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3828kb
input:
2 4 5 6 12 1 3 6 15 8 1 3 100 3 200 4 300 6 100
output:
Yes No
result:
ok 2 token(s): yes count is 1, no count is 1
Test #2:
score: 0
Accepted
time: 1ms
memory: 3844kb
input:
100 22 5902 2156 41112 4784 2494327 2156 18332 1932 561243 7775 6411977 4325 42582 3982 5455884 7775 3752795 1932 268336 2156 43482 4325 1574341 4325 407463 2156 3547 2156 120919 8417 3789084 4784 214691 1932 4577101 7775 7488110 3982 2029754 1932 5995988 3982 3291414 2156 1094658 69 8933 6042 13932...
output:
No Yes Yes Yes Yes Yes Yes Yes No No Yes No Yes Yes Yes Yes Yes No Yes Yes Yes Yes Yes Yes Yes No No No Yes Yes No No Yes No No Yes No Yes Yes Yes Yes Yes No Yes Yes Yes Yes Yes No Yes Yes No Yes Yes No No No No No No Yes Yes Yes Yes Yes Yes Yes Yes Yes No Yes No Yes No No Yes No Yes Yes Yes No Yes ...
result:
ok 100 token(s): yes count is 62, no count is 38