Submission #418749

#	Time	Username	Problem	Language	Result	Execution time	Memory
418749		iraira655	Jelly Flavours (IOI20_jelly)	C++17	0 / 100	2 ms	384 KiB

jelly

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


int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) {
	int n = a.size();
  
  vector<pair<int, int>> a1, b1;

	for(int i =0; i<n; i++){
		a1.push_back({a[i], b[i]});
	}
  sort(a1.begin(), a1.end());

  int ans = 0;
  for(int j=0; j<n; j++){
    if(a1[j].first < a1[j].second && x >= a1[j].first){
      x-=a1[j].first;
      ans++;
    }
    else if(a1[j].first == a1[j].second){
      if(x<=y && y>= a1[j].second){
        y-=a1[j].second;
        ans++;
      }
      else if(x>=y && x>= a1[j].first){
        x-=a1[j].first;
        ans++;
      }
    }
    else if(a1[j].first > a1[j].second && y >= a1[j].second){
      y-=a1[j].second;
      ans++;
    }
  }


	return ans;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 24
• Subtask 3: 0 / 9
• Subtask 4: 0 / 10
• Subtask 5: 0 / 14
• Subtask 6: 0 / 32