Submission #63553328

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
 
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  
  int N, M; 
  cin >> N >> M;
  vector<ll> bl(N), w(M);
  for (int i = 0; i < N; i++) 
    cin >> bl[i];
  for (int j = 0; j < M; j++) 
    cin >> w[j];
  
  vector<ll> blPos, blNeg;
  for (auto b : bl)
    (b >= 0 ? blPos : blNeg).push_back(b);
  
  sort(blNeg.begin(), blNeg.end(), greater<ll>());
  
  vector<ll> wPos;
  for (auto w : w)
    if(w > 0)
      wPos.push_back(w);
  sort(wPos.begin(), wPos.end(), greater<ll>());
  
  ll ans = 0;
  for(auto b : blPos) 
    ans += b;
  
  int k = blPos.size();
  int wChosen = min((int)wPos.size(), k);
  for (int i = 0; i < wChosen; i++){
    ans += wPos[i];
  }
  
  int extra = wPos.size() - wChosen;
  int pairs = min(extra, (int)blNeg.size());
  for (int i = 0; i < pairs; i++){
    ll gain = wPos[k + i] + blNeg[i];
    if(gain > 0) 
      ans += gain;
    else 
      break;
  }
  
  cout << ans << "\n";
  return 0;
}

Submission Info

Submission Time
Task C - Buy Balls
User t0wbo2t
Language C++ 20 (gcc 12.2)
Score 300
Code Size 1098 Byte
Status AC
Exec Time 51 ms
Memory 11060 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 49
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_test_00.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt, 01_test_12.txt, 01_test_13.txt, 01_test_14.txt, 01_test_15.txt, 01_test_16.txt, 01_test_17.txt, 01_test_18.txt, 01_test_19.txt, 01_test_20.txt, 01_test_21.txt, 01_test_22.txt, 01_test_23.txt, 01_test_24.txt, 01_test_25.txt, 01_test_26.txt, 01_test_27.txt, 01_test_28.txt, 01_test_29.txt, 01_test_30.txt, 01_test_31.txt, 01_test_32.txt, 01_test_33.txt, 01_test_34.txt, 01_test_35.txt, 01_test_36.txt, 01_test_37.txt, 01_test_38.txt, 01_test_39.txt, 01_test_40.txt, 01_test_41.txt, 01_test_42.txt, 01_test_43.txt, 01_test_44.txt, 01_test_45.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 1 ms 3508 KiB
00_sample_01.txt AC 1 ms 3380 KiB
00_sample_02.txt AC 1 ms 3512 KiB
01_test_00.txt AC 1 ms 3520 KiB
01_test_01.txt AC 1 ms 3516 KiB
01_test_02.txt AC 1 ms 3452 KiB
01_test_03.txt AC 21 ms 6212 KiB
01_test_04.txt AC 14 ms 5180 KiB
01_test_05.txt AC 13 ms 5304 KiB
01_test_06.txt AC 40 ms 9388 KiB
01_test_07.txt AC 40 ms 9292 KiB
01_test_08.txt AC 39 ms 9472 KiB
01_test_09.txt AC 41 ms 9420 KiB
01_test_10.txt AC 40 ms 9416 KiB
01_test_11.txt AC 40 ms 9480 KiB
01_test_12.txt AC 40 ms 9548 KiB
01_test_13.txt AC 40 ms 9368 KiB
01_test_14.txt AC 40 ms 9488 KiB
01_test_15.txt AC 39 ms 8860 KiB
01_test_16.txt AC 45 ms 9664 KiB
01_test_17.txt AC 34 ms 7760 KiB
01_test_18.txt AC 44 ms 9800 KiB
01_test_19.txt AC 38 ms 8816 KiB
01_test_20.txt AC 45 ms 11060 KiB
01_test_21.txt AC 36 ms 8048 KiB
01_test_22.txt AC 46 ms 11000 KiB
01_test_23.txt AC 32 ms 8496 KiB
01_test_24.txt AC 44 ms 9780 KiB
01_test_25.txt AC 32 ms 8212 KiB
01_test_26.txt AC 40 ms 9324 KiB
01_test_27.txt AC 29 ms 8912 KiB
01_test_28.txt AC 34 ms 9592 KiB
01_test_29.txt AC 38 ms 8596 KiB
01_test_30.txt AC 46 ms 9540 KiB
01_test_31.txt AC 33 ms 8552 KiB
01_test_32.txt AC 45 ms 9860 KiB
01_test_33.txt AC 32 ms 8584 KiB
01_test_34.txt AC 38 ms 10984 KiB
01_test_35.txt AC 42 ms 10100 KiB
01_test_36.txt AC 51 ms 10848 KiB
01_test_37.txt AC 20 ms 6316 KiB
01_test_38.txt AC 32 ms 8224 KiB
01_test_39.txt AC 19 ms 7440 KiB
01_test_40.txt AC 25 ms 8276 KiB
01_test_41.txt AC 24 ms 6456 KiB
01_test_42.txt AC 38 ms 8232 KiB
01_test_43.txt AC 1 ms 3444 KiB
01_test_44.txt AC 20 ms 5668 KiB
01_test_45.txt AC 21 ms 6628 KiB