Submission #756506

#	Time	Username	Problem	Language	Result	Execution time	Memory
756506		Olympia	Schools (IZhO13_school)	C++17	100 / 100	199 ms	25096 KiB

school

#include <vector>
#include <iostream>
#include <cassert>
#include <random>
#include <cmath>
#include <map>
#include <algorithm>
#include <bitset>
#include <random>
#include <queue>
#include <set>
#include <stack>
#define ll int64_t
using namespace std;
bool comp (pair<int64_t, int64_t> p1, pair<int64_t, int64_t> p2) {
	return (p1.first - p1.second < p2.first - p2.second);
}
vector<ll> get_max (vector<ll> v, int k) {
	multiset<ll> best;
	vector<ll> ans;
	ans.push_back(-1e17);
	ll sum = 0;
	for (int i = 0; i < v.size(); i++) {
		if (i <= k - 1) {
			best.insert(v[i]);
			sum += v[i];
		} else {
			if (v[i] >= *(best.begin())) {
				sum -= *(best.begin());
				best.erase(best.find(*(best.begin())));
				sum += v[i];
				best.insert(v[i]);
			}
		}
		ans.push_back(((i >= k - 1) ? sum : -1e17));
	}
	return ans;
}
ll sum (vector<ll> v) {
	ll ans = 0;
	for (ll x: v) {
		ans += x;
	}
	return ans;
}
int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int N, M, S;
    cin >> N >> M >> S;
    vector<pair<ll,ll>> vec(N);
    vec.resize(N);
    for (int i = 0; i < N; i++) {
    	cin >> vec[i].first >> vec[i].second;
    }
    sort(vec.begin(), vec.end(), comp);
    vector<ll> a, b;
    for (int i = 0; i < N; i++) {
    	a.push_back(vec[i].first), b.push_back(vec[i].second);
    }
    if (S == 0) {
    	cout << get_max(a, M).back();
    	exit(0);
    }
    if (M == 0) {
    	cout << get_max(b, S).back();
    	exit(0);
    }
    reverse(a.begin(), a.end());
    auto res1 = get_max(a, M);
    auto res2 = get_max(b, S);
    reverse(res2.begin(), res2.end());
    int64_t ans = 0;
    for (int i = 0; i <= N; i++) {
    	ans = max(ans, res1[i] + res2[i]);
    }
    cout << ans;
}

Compilation message (stderr)

school.cpp: In function 'std::vector<long int> get_max(std::vector<long int>, int)':
school.cpp:23:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |  for (int i = 0; i < v.size(); i++) {
      |                  ~~^~~~~~~~~~

• Subtask 1: 100 / 100