This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
// bismillah subtask gampang
int main() {
int soal, elang;
cin >> soal >> elang;
vector<int> prefsum(soal + 1, 0);
for (int i = 1; i <= soal; i++)
{
int x, y;
cin >> x >> y;
prefsum[i] = prefsum[i - 1] + y;
}
for (int i = 0; i < elang; i++)
{
int l, c;
cin >> l >> c;
int idx = upper_bound(prefsum.begin(), prefsum.end(), prefsum[l - 1] + c) - prefsum.begin();
cout << (idx == (soal + 1) ? 0 : idx) << endl;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |