天生我材必有难,千金散尽还债来 • 6个月前
using namespace std;
int main() {
queue<int> d, x;
int n;
cin >> n;
for (int k = 0; k < n; k++) {
int a, b;
cin >> a >> b;
d.push(a);
x.push(b);
}
int ch2;
cin >> ch2;
vector<int> ch;
int l = 0;
while (1) {
cout << d.front() << " " << l << endl;
while (ch.size() < ch2 && d.front() <= l) {
ch.push_back(x.front());
x.pop();
d.pop();
}
for (int k = 0; k < ch2; k++) {
ch[k]--;
if (ch[k] == 0) {
ch.erase(ch.begin() + k);
}
cout << k << " " << ch.size() << endl;
int n = ch.size() - 1;
cout << n << " ";
if (k >= n) {
cout << "1111";
break;
}
}
l++;
cout << l << " " << ch.size() << " " << x.size() << endl;
if (ch.size() < ch2) {
cout << "can push" << ch2 - ch.size() << endl;
}
if (ch.empty() && x.empty()) {
break;
}
}
cout << l;
return 0;
}
评论:
请先登录,才能进行评论