#include <bits/stdc++.h>
#include "fish.h"
using namespace std;
typedef long long ll;
ll max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
ll sm[2] = {};
vector<pair<int, int>> vec[2];
for (int i = 0; i < m; i ++){
sm[x[i]] += w[i];
vec[x[i]].push_back({y[i], w[i]});
}
sort(vec[0].begin(), vec[0].end());
sort(vec[1].begin(), vec[1].end());
ll ans = max(sm[0], sm[1]);
sm[0] = 0;
int it = 0;
for (auto [yy, ww] : vec[0]){
sm[0] += ww;
while (it < vec[1].size() and vec[1][it].first <= yy)
sm[1] -= vec[1][it++].second;
ans = max(ans, sm[0] + sm[1]);
}
return ans;
}
# | 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... |