244622026-02-11 21:03:53Pedri26MI bróker (50 pont)cpp17Wrong answer 2/503ms544 KiB
#include <bits/stdc++.h>

using namespace std;
int n, q, a[501];

int main() {
    // Gyors I/O
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cin>>n>>q;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    for(int i=1;i<=q;i++)
    {
        int also, felso, s=0;
        cin>>felso>>also;
        bool van=false;
        for(int j=1;j<=n;j++)
        {
            if(!van)
            {
                if(a[j]<=felso)
                {
                    s-=a[j];
                    van=true;
                }
            }
            else
            {
                if(a[j]>=also)
                {
                    s+=a[j];
                    van=false;
                }
            }
        }
        cout<<s<<endl;
    }
   

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base2/50
1Accepted0/01ms512 KiB
2Wrong answer0/02ms316 KiB
3Accepted1/11ms316 KiB
4Accepted1/11ms500 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/22ms316 KiB
8Wrong answer0/11ms316 KiB
9Wrong answer0/12ms324 KiB
10Wrong answer0/21ms316 KiB
11Wrong answer0/22ms316 KiB
12Wrong answer0/21ms512 KiB
13Wrong answer0/21ms316 KiB
14Wrong answer0/22ms508 KiB
15Wrong answer0/33ms316 KiB
16Wrong answer0/32ms316 KiB
17Wrong answer0/32ms316 KiB
18Wrong answer0/32ms316 KiB
19Wrong answer0/32ms500 KiB
20Wrong answer0/32ms544 KiB
21Wrong answer0/32ms316 KiB
22Wrong answer0/31ms508 KiB
23Wrong answer0/31ms336 KiB
24Wrong answer0/31ms316 KiB