#include "fish.h"
#include <vector>
#include <algorithm>
using namespace std;
#define ll long long
long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
ll can1 = 0;
ll can2 = 0;
for (int i = 0; i < M; i++) {
if (X[i] == 0)
can2 += W[i];
else
can1 += W[i];
}
if (N == 2) {
return max(can1, can2);
} else {
vector<pair<int, int>> v;
for (int i = 0; i < M; i++) {
v.push_back({Y[i], i});
}
struct {
bool operator()(pair<int, int> a, pair<int, int> b) const {
if (a.first == b.first) return a.second > b.second;
return a.first < b.first;
}
}
customLess;
sort(v.begin(), v.end(), customLess);
ll tmp = can1;
for (int i = 0; i < M; i++) {
int j = v[i].second;
if (X[j] == 0) {
tmp += W[j];
} else {
tmp -= W[j];
}
can1 = max(tmp, can1);
}
return can1;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |