# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1169456 | Szymon_Pilipczuk | Jelly Flavours (IOI20_jelly) | C++20 | 0 ms | 0 KiB |
#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>> mc(n);
for(int i = 0;i<n;i++)
{
mc[i] = {a[i],b[i]};
}
vector<pair<int,int>> mc(n);
sort(mc.begin(),mc.end());
int dp[n][x+1];
for(int i = 0;i<n;i++)
{
for(int j = 0;j<=x;j++)
{
if(i == 0)
{
if(j >= mc[i].first)
{
dp[i][j] = 0;
}
else
{
dp[i][j] = mc[i].second;
}
}
else
{