Kyselyt

#include <bits/stdc++.h>

#define ll long long
#define M 1000000007

using namespace std;

int x[222222];
int sx[222222][111];
int cnts[111];
bool u[222222];

int main() {
    cin.sync_with_stdio(false);
    cin.tie(0);
    int n, q;
    cin>>n>>q;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= 100; j++) {
            sx[i][j] = sx[i - 1][j];
        }
        cin>>x[i];
        sx[i][x[i]]++;
    }
    while (q --> 0) {
        int a, b;
        cin>>a>>b;
        int ans = 0;
        for (int i = 1; i <= 100; i++) {
            cnts[i] = sx[b][i] - sx[a - 1][i];
        }
        int i = 50;
        for (int j = 100; j >= 2; j--) {
            while (cnts[j] && i) {
                while (i >= 1 && (2 * i > j || cnts[i] == 0)) {
                    i--;
                }
                if (!i) break;
                int c = min(cnts[i], cnts[j]);
                ans += c;
                cnts[i] -= c;
                cnts[j] -= c;
            }
        }
        cout<<ans<<endl;
    }
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: RUNTIME ERROR

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED