제출 #551908

#제출 시각아이디문제언어결과실행 시간메모리
551908smunteanuJelly Flavours (IOI20_jelly)C++14
0 / 100
1 ms340 KiB
#include <bits/stdc++.h>
using namespace std;

int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) {

  sort(a.begin(), a.end());
  int count = 0;
  for (int &k : b) count += k == 0;
  for (int &k : a) {
    x -= k;
    if (x >= 0) count++;
    else return count;
  }
  return count;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...