251372026-02-18 08:36:07KoszorusBlankaMI bróker (50 pont)cpp17Time limit exceeded 8/501.1s696 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int N, Q;
    cin >> N >> Q;

    int a[10001];
    for (int i = 1; i <= N; i++)
        cin >> a[i];

    int V, E;
    for (int i = 1; i <= Q; i++) {
        cin >> V >> E;
        int ossz = 0;
        bool van = false;

        for (int j = 1; j <= N; j++) {
            if (!van && a[j] <= V) {
                van = true;
                ossz -= a[j];
            }else if (van && a[j] >= E) {
                van = false;
                ossz += a[j];
            }
        }

        cout << ossz << endl;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base8/50
1Accepted0/01ms520 KiB
2Time limit exceeded0/01.088s444 KiB
3Accepted1/11ms316 KiB
4Accepted1/11ms500 KiB
5Accepted2/21ms316 KiB
6Accepted2/26ms316 KiB
7Accepted2/26ms316 KiB
8Time limit exceeded0/11.1s444 KiB
9Time limit exceeded0/11.098s440 KiB
10Time limit exceeded0/21.1s440 KiB
11Time limit exceeded0/21.083s444 KiB
12Time limit exceeded0/21.082s564 KiB
13Time limit exceeded0/21.098s696 KiB
14Time limit exceeded0/21.1s444 KiB
15Time limit exceeded0/31.08s564 KiB
16Time limit exceeded0/31.085s564 KiB
17Time limit exceeded0/31.1s440 KiB
18Time limit exceeded0/31.1s444 KiB
19Time limit exceeded0/31.09s564 KiB
20Time limit exceeded0/31.085s444 KiB
21Time limit exceeded0/31.1s692 KiB
22Time limit exceeded0/31.1s612 KiB
23Time limit exceeded0/31.088s564 KiB
24Time limit exceeded0/31.078s564 KiB