# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
679685 | boyliguanhan | Catfish Farm (IOI22_fish) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
long long max_weights(int n, int m, int x[], int y[], int w[]){
int res[2];
for(int i = 0; i < n; i++)
res[x[i]%2]+=w[i];
return max(res[0], res[1]);
}