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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
#include <iostream>
#include <iterator>
#include <list>
using namespace std;

typedef struct fish {
    long long size = 0;
    bool wasEaten = false;
} Tfish;

// non empty list
list<Tfish> insertElementToSortedList(list<Tfish> l, Tfish x) {
    list<Tfish>::iterator it = l.begin();
    while (it != l.end() && x.size < (*it).size) {
        it++;
    }
    l.insert(it, x);
    return l;
}
list<Tfish> deleteElementFromList(list<Tfish> l, Tfish x) {
    list<Tfish>::iterator it = l.begin();
    while ((*it).size != x.size) {
        it++;
    }
    l.erase(it);
    return l;
}
void printList(list<Tfish> l) {
    list<Tfish>::iterator it;
    for (it = l.begin(); it != l.end(); it++) {
        cout << (*it).size << " ";
    }
    cout << '\n';
}

void resetList(list<Tfish> l) {
    list<Tfish>::iterator it;
    for (it = l.begin(); it != l.end(); it++) {
        (*it).wasEaten = false;
    }
}

long long numOfDeadFishBrute(list<Tfish> l, long long startWeight,
                             long long endWeight, long long numOfFish) {
    long long weight = startWeight;
    long long i = 0;
    list<Tfish>::iterator it;
    // cout << "start przebiegu: start: " << startWeight
    //      << " koniec: " << endWeight << " liczba ryb: " << numOfFish << '\n';
    // cout << "lista: ";
    // printList(l);
    while (weight < endWeight && i < numOfFish) {
        // cout << "początek obrotu" << '\n';
        // cout << "waga " << weight << '\n';
        // cout << "ilość zjedzonych ryb: " << i << '\n';
        it = l.end();
        while (it != l.begin() && weight > (*prev(it)).size) {
            it--;
        }
        while ((*it).wasEaten) {
            it++;
        }
        if (it != l.end() && weight > (*it).size) {
            i++;
            weight += (*it).size;
            (*it).wasEaten = true;
        } else {
            return -1;
        }
    }
    resetList(l);
    if (weight >= endWeight) {
        return i;
    }
    return -1;
}
// l is sorted and with first empty element
// int numOfDeadFish(list<Tfish> l, int startWeight, int endWeight,
//                   int numOfFish) {
//     // cout << "start przebiegu: start: " << startWeight
//     //      << " koniec: " << endWeight << " liczba ryb: " << numOfFish <<
//     '\n';
//     // cout << "lista: ";
//     // printList(l);
//     if (endWeight - startWeight <= 0)
//         return 0;
//     int weight = startWeight;
//     list<Tfish>::iterator firstEatenFish = l.begin();

//     while (firstEatenFish != l.end() && weight <= (*firstEatenFish).size)
//         firstEatenFish++;
//     // cout << "pierwsza zjedzona ryba: " << *firstEatenFish << '\n';
//     // firstEatenFish == l.end || weight > (*firstEatenFish).size
//     if (firstEatenFish == l.end()) {
//         int lastFishSize = (*firstEatenFish).size;
//         if (startWeight + lastFishSize >= endWeight)
//             return 1;
//         else
//             return -1;
//     }

//     // firstEatenFish != l.end && weight > (*firstEatenFish).size
//     int i = 1; // number of eaten fish
//     weight += (*firstEatenFish).size;
//     list<Tfish>::iterator lastEatenFish = firstEatenFish;
//     while (weight < endWeight && i < numOfFish) {
//         while (firstEatenFish != l.begin() &&
//                weight > (*prev(firstEatenFish)).size) {
//             firstEatenFish--;
//         }
//         if (weight > (*firstEatenFish).size) {
//             weight += (*firstEatenFish).size;
//             (*firstEatenFish).wasEaten = true;
//             i++;
//         }
//         if (next(lastEatenFish) != l.end() &&
//             weight > (*next(lastEatenFish)).size) {
//             lastEatenFish++;
//             weight += (*lastEatenFish).size;
//             // (*lastEatenFish).wasEaten = true;
//             i++;
//         } else {
//             return -1;
//         }
//     }
//     if (weight >= endWeight) {
//         return i;
//     } else {
//         return -1;
//     }
// }

Tfish newFish(long long x) {
    Tfish fish;
    fish.size = x;
    fish.wasEaten = false;
    return fish;
}

void inputData() {
    list<Tfish> l;
    long long n;
    long long tmp;
    Tfish fish;
    long long s, k, w;
    cin >> n;
    cin >> tmp;
    // cout << n;
    l.push_front(newFish(tmp));
    for (long long i = 1; i < n; i++) {
        cin >> tmp;
        l = insertElementToSortedList(l, newFish(tmp));
    }
    // printList(l);
    long long q;
    cin >> q;
    // cout << q << '\n';
    for (long long i = 0; i < q; i++) {
        cin >> tmp;
        switch (tmp) {
        case 1:
            cin >> s;
            cin >> k;
            cout << numOfDeadFishBrute(l, s, k, n) << '\n';
            break;
        case 2:
            cin >> w;
            n++;
            l = insertElementToSortedList(l, newFish(w));
            // cout << "dodanie elementu do listy: ";
            // printList(l);
            break;
        case 3:
            cin >> w;
            n--;
            l = deleteElementFromList(l, newFish(w));
            break;
        }
    }
}

int main() {
    inputData();
    return 0;
}