Submission #169583

#	Time	Username	Problem	Language	Result	Execution time	Memory
169583		davitmarg	Schools (IZhO13_school)	C++17	25 / 100	213 ms	16352 KiB

school

/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(), v.end()
using namespace std;

const int N = 300005;

int n, m, s, k;
LL ans = 0;
pair<LL, LL> a[N];
multiset<LL> M, S;
vector<pair<LL, LL>> K;
int main()
{
    cin >> n >> m >> s;
    k = n - m - s;
    for (int i = 1; i <= n; i++)
        scanf("%lld%lld", &a[i].first, &a[i].second);
    sort(a + 1, a + 1 + n, [](pair<LL, LL> a, pair<LL, LL> b) {
        return a.first - a.second < b.first - b.second;
    });
    for (int i = 1; i <= s; i++)
    {
        ans += a[i].second;
        S.insert(a[i].second);
    }
    for (int i = s + 1; i <= s + k; i++)
        K.PB(a[i]);

    for (int i = s + k + 1; i <= n; i++)
    {
        ans += a[i].first;
        M.insert(a[i].first);
    }

    sort(all(K));
    reverse(all(K));
    for (int i = 0; i < K.size() && i < m; i++)
    {
        LL x = K[i].first, y = K[i].second;
        swap(K[i].first, K[i].second);
        LL d1 = -1, d2 = -1;
        if (!M.empty())
            d1 = x - (*M.begin());
        if (!S.empty())
            d2 = y - (*S.begin());
        if (max(d1, d2) < 0)
            continue;
        if (d1 >= d2)
        {
            M.erase(M.begin());
            K[i] = MP(0, 0);
            //M.insert(x);
            ans += d1;
        }
    }

    sort(all(K));
    reverse(all(K));
    for (int i = 0; i < K.size() && i < s; i++)
    {
        LL x = K[i].second, y = K[i].first;
        LL d2 = -1;
        if (!S.empty())
            d2 = y - (*S.begin());
        if (d2 < 0)
            continue;
        S.erase(S.begin());
        //M.insert(x);
        ans += d2;
    }
    cout << ans << endl;
    return 0;
}

/*

4 1 1
100 0
500 500
500 500
0 100


*/

Compilation message (stderr)

school.cpp: In function 'int main()':
school.cpp:58:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < K.size() && i < m; i++)
                     ~~^~~~~~~~~~
school.cpp:80:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < K.size() && i < s; i++)
                     ~~^~~~~~~~~~
school.cpp:82:12: warning: unused variable 'x' [-Wunused-variable]
         LL x = K[i].second, y = K[i].first;
            ^
school.cpp:38:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld%lld", &a[i].first, &a[i].second);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 25 / 100