148292025-02-04 11:58:53ercseferencMI bróker (50 pont)cpp17Time limit exceeded 8/501.1s1324 KiB
#include <iostream>
using namespace std;
int main()
{
    int n,m,e,v;
    cin>>n>>m; int a[n];
    for(int i=0; i<n; i++){cin>>a[i];}
    for(int i=0; i<m; i++){
        cin>>v>>e; bool van=0; int s=0;
        for(int i=0; i<n; i++){
            if(!van && a[i]<=v){s-=a[i]; van=1;}
            if(van && a[i]>=e){s+=a[i]; van=0;}}
        cout<<s<<endl;}
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base8/50
1Accepted0/01ms508 KiB
2Time limit exceeded0/01.087s820 KiB
3Accepted1/11ms316 KiB
4Accepted1/11ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/26ms316 KiB
7Accepted2/24ms476 KiB
8Time limit exceeded0/11.098s1324 KiB
9Time limit exceeded0/11.098s1064 KiB
10Time limit exceeded0/21.098s696 KiB
11Time limit exceeded0/21.08s820 KiB
12Time limit exceeded0/21.085s820 KiB
13Time limit exceeded0/21.088s824 KiB
14Time limit exceeded0/21.088s820 KiB
15Time limit exceeded0/31.083s820 KiB
16Time limit exceeded0/31.088s820 KiB
17Time limit exceeded0/31.098s964 KiB
18Time limit exceeded0/31.1s808 KiB
19Time limit exceeded0/31.088s824 KiB
20Time limit exceeded0/31.087s952 KiB
21Time limit exceeded0/31.1s928 KiB
22Time limit exceeded0/31.098s812 KiB
23Time limit exceeded0/31.09s820 KiB
24Time limit exceeded0/31.078s812 KiB