245362026-02-12 17:29:43AkosVagyokEmborZenehallgatáscpp17Wrong answer 0/50109ms32000 KiB
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector <int> zenek, st, seg;
int zsz, sszam, sum;
void be() {
    cin >> zsz>>sszam;
    zenek.resize(zsz+1);
    st.resize(sszam + 1);
    for (int i = 1; i <= zsz; i++) {
        cin >> zenek[i];
        sum += zenek[i];
        if (i != 1) {
            //zenek[i] += zenek[i];
        }
    }
    for (int i = 1; i <= sszam; i++) {
        cin >> st[i];        
    }
    int index = 0;
    seg.resize(sum + 1);
}
void nagy() {
    for (int k = 1; k <= sszam; k++) {
        
    }
}



int main()
{
    be();
    nagy();

    
}
SubtaskSumTestVerdictTimeMemory
base0/50
1Wrong answer0/01ms316 KiB
2Runtime error0/0103ms32000 KiB
3Wrong answer0/221ms19716 KiB
4Wrong answer0/212ms10056 KiB
5Wrong answer0/23ms2356 KiB
6Wrong answer0/32ms564 KiB
7Wrong answer0/32ms316 KiB
8Wrong answer0/32ms316 KiB
9Runtime error0/2108ms32000 KiB
10Runtime error0/2109ms32000 KiB
11Runtime error0/2101ms32000 KiB
12Runtime error0/2107ms32000 KiB
13Runtime error0/2103ms32000 KiB
14Runtime error0/298ms32000 KiB
15Runtime error0/2104ms32000 KiB
16Runtime error0/2103ms32000 KiB
17Runtime error0/2105ms32000 KiB
18Wrong answer0/290ms20924 KiB
19Wrong answer0/290ms20908 KiB
20Wrong answer0/268ms3120 KiB
21Wrong answer0/268ms3244 KiB
22Wrong answer0/368ms3248 KiB
23Wrong answer0/365ms1960 KiB
24Wrong answer0/365ms1964 KiB