1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
// Artur Kraska, II UWr

#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <cmath>
#include <list>
#include <set>
#include <map>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(typeof(coll.begin()) iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(typeof(coll.rbegin()) iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,R,PRED)            ({typeof(P) X=P,RRR=(R), PPP = P; while(PPP<RRR) {X = (PPP+(RRR-PPP)/2); if(PRED) RRR = X; else PPP = X+1;} PPP;})
#define testy()                     int _tests; scanf("%d", &_tests); FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#define FOR(i, a, b)                for(int i=a; i<=b; i++)
#define FORD(i, a, b)               for(int i=a; i>=b; i--)
#define MP                          make_pair
#define PB                          push_back
#define deb(X)                      ;

#define M 1000000007
#define INF 1000000007

using namespace std;

int n, m, k;
long long w, h;
map <long long, long long> mapa;
set <pair<int, int> > S;

struct elem
{
    int x, y;
    int koszt;
    bool plus;
    long long poziom, pion;
};
elem tab[400007];

static inline bool comp_poziom(const elem &e1, const elem &e2)
{
    if(e1.poziom != e2.poziom)
        return e1.poziom > e2.poziom;
    return e1.pion < e2.pion;
}

int main()
{
    scanf("%d %d", &n, &m);
    //cin >> n >> m;
    cin >> w >> h;

    deb((long long skarby = 0, koszty = 0));
    forr(i, n+m)
    {
        scanf("%d %d %d", &tab[i].x, &tab[i].y, &tab[i].koszt);
        //cin >> tab[i].x >> tab[i].y >> tab[i].koszt;
        //tab[i].x *= 2;
        //tab[i].y *= 2;
        //tab[i].x += 107;
        tab[i].poziom = tab[i].x*h - tab[i].y*w;
        tab[i].pion = tab[i].x*h + tab[i].y*w;

        deb(if(i < n)
            skarby += tab[i].koszt;
        else
            koszty += tab[i].koszt);
    }

    deb(cout << " skarby: " << skarby << ", koszty: " << koszty << endl);

    forr(i, n)
        tab[i].plus = 1;

    sort(tab, tab+n+m, comp_poziom);

    forr(i, n+m)
    {
        deb(cout << "teraz jest (" << tab[i].x << ", " << tab[i].y << "), koszt: " << tab[i].koszt << ", eksponat: " << tab[i].plus << endl);

        if(tab[i].plus)
            mapa[tab[i].pion] += tab[i].koszt;
        else
        {
            //long long suma = -tab[i].koszt;
            while(!mapa.empty() && mapa.begin()->first <= tab[i].pion && tab[i].koszt > 0)
            {
                if(mapa.begin()->second <= tab[i].koszt)
                {
                    tab[i].koszt -= mapa.begin()->second;
                    mapa.erase(mapa.begin());
                }
                else
                {
                    mapa.begin()->second -= tab[i].koszt;
                    tab[i].koszt = 0;
                }
            }
        }

        deb(cout << "mapa:";
        FOREACH(it, mapa)
            cout << " " << it->second;
        cout << endl);
    }

    long long wynik = 0;
    FOREACH(it, mapa)
        wynik += it->second;

    cout << wynik << endl;

    return 0;
}