245352026-02-12 17:29:09AkosVagyokEmborZenehallgatáscpp17Wrong answer 0/5028ms1272 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
2Wrong answer0/028ms1076 KiB
3Wrong answer0/21ms500 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/31ms388 KiB
7Wrong answer0/31ms508 KiB
8Wrong answer0/31ms316 KiB
9Wrong answer0/228ms1192 KiB
10Wrong answer0/228ms1196 KiB
11Wrong answer0/227ms1260 KiB
12Wrong answer0/227ms1164 KiB
13Wrong answer0/224ms1144 KiB
14Wrong answer0/224ms1076 KiB
15Wrong answer0/224ms1268 KiB
16Wrong answer0/224ms1076 KiB
17Wrong answer0/224ms1096 KiB
18Wrong answer0/221ms1092 KiB
19Wrong answer0/220ms1076 KiB
20Wrong answer0/218ms1080 KiB
21Wrong answer0/218ms1272 KiB
22Wrong answer0/318ms1076 KiB
23Wrong answer0/318ms1076 KiB
24Wrong answer0/317ms1076 KiB