why my code is failing in tc 3

arifin_fuad_kashfy's blog

By arifin_fuad_kashfy, history, 5 weeks ago, In English

hello, hope all is well, my code and me is not well, here is my submission here my submission...

pls hlep do i need do learn anything or what was my fault pls thanks in advance >3.

arifin_fuad_kashfy
5 weeks ago
3

Comments (3)

Write comment?

avnlk

5 weeks ago, # |

which question are you talking about? You gave link to your entire submissions page.

→ Reply

arifin_fuad_kashfy

5 weeks ago, # ^ |

the lat one maximum sum wa on tc 3

→ Reply

nauthnim

5 weeks ago, # |

It's your fault for making it too complicated by calculating sum1, sum2, sum3, and sum4.
If you can go that far, just take it a step further and think about how to find all possible sums and get the maximum one.

My code

void solve() {
    int n,k; cin>>n>>k;
    vector<int> a(n);
    int sum  = 0;
    for(int i=0;i<n;++i) {
        int x; cin>>x;
        sum +=x;
        a[i] = x;
    }
    sort(a.begin(), a.end());
    vector<int> pre_sum(n+1, 0);
    for(int i=0;i<n;++i) pre_sum[i+1] = pre_sum[i] + a[i];
    int ans = 0;
    for(int i = 0;i<=k;++i) {
        int remove_right = pre_sum[n] - pre_sum[n-i];
        int remove_left = pre_sum[(k-i)*2];
        ans = max(ans, sum - remove_left - remove_right);
    }
    cout<<ans<<endl;
}

→ Reply