# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
625997 | aryan12 | 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 "fish.h"
#include <vector>
long long max_weights(int N, int M, std::vector<int> X,
std::vector<int> Y, std::vector<int> W) {
long long ans1 = 0, ans2 = 0;
for(int i = 0; i < W.size(); i++)
{
if(X[i] == 0) ans1 += W[i];
else ans2 += W[i];
}
return max(ans1, ans2); // subtask 1
}