Submission #73911175


Source Code Expand

#include<bits/stdc++.h>
using namespace std;

void solve(int n, vector<int>& a, vector<int>& b, vector<int>& c)
{
  int sum = 0;
  
  for(int i = 0; i < n; i++)
  {
    if(b[i] <= c[a[i] - 1])
    {
      c[a[i] - 1] -= b[i];
      sum += b[i];
    }
    else
    {
      sum += c[a[i] - 1];
      c[a[i] - 1] = 0;
    }
  }
  cout << sum;
}

int main()
{
  int n, m;
  cin >> n >> m;
  vector<int> c(m), a(n), b(n);
  for(int i = 0; i < m; i++)
  {
    cin >> c[i];
  }
  for(int i = 0; i < n; i++)
  {
    cin >> a[i] >> b[i];
  }
  
  solve(n, a, b, c);
  return 0;
}

Submission Info

Submission Time
Task B - Pepper Addiction
User Lokesh_Guptha
Language C++23 (GCC 15.2.0)
Score 200
Code Size 609 Byte
Status AC
Exec Time 2 ms
Memory 3692 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 20
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt
Case Name Status Exec Time Memory
sample_01.txt AC 2 ms 3692 KiB
sample_02.txt AC 1 ms 3412 KiB
sample_03.txt AC 1 ms 3556 KiB
test_01.txt AC 1 ms 3412 KiB
test_02.txt AC 1 ms 3500 KiB
test_03.txt AC 1 ms 3496 KiB
test_04.txt AC 2 ms 3680 KiB
test_05.txt AC 2 ms 3376 KiB
test_06.txt AC 1 ms 3496 KiB
test_07.txt AC 1 ms 3516 KiB
test_08.txt AC 1 ms 3680 KiB
test_09.txt AC 1 ms 3588 KiB
test_10.txt AC 2 ms 3608 KiB
test_11.txt AC 2 ms 3424 KiB
test_12.txt AC 2 ms 3568 KiB
test_13.txt AC 2 ms 3656 KiB
test_14.txt AC 1 ms 3496 KiB
test_15.txt AC 1 ms 3588 KiB
test_16.txt AC 2 ms 3580 KiB
test_17.txt AC 2 ms 3656 KiB