Youngling tournament

#include <bits/stdc++.h>

#define i64 long long
#define u64 unsigned long long
#define i32 int
#define u32 unsigned int

#define pii pair<int, int>
#define pll pair<long long, long long>

#define ld long double
#define defmod 1000000007

#define mati64(a,b) vector<vector<i64>>(a, vector<i64>(b, 0));
using namespace std;
int n;
vector<i64> f;
multiset<i64> pir[60];
i64 k[101010], cf[101010];
i64 hb(i64 b){
	for(int i = 61; i >= 0; i--){
		if((b&1LL<<i))
			return i;
	}
	return 0;
}
i64 su[60];

i64 rip(){
	i64 re = 0, s = 0;

	for(int i = 0; i < 60; ++i){
		if(pir[i].size() > 0){
			if(*pir[i].begin() >= s)
				re++;
			if(pir[i].size() > 1){
				//cout << *(pir[i].begin()++)  << " vs "  << s+*pir[i].begin() << endl;
				if(*(++pir[i].begin())  >= s+*pir[i].begin())
					re++;
			}
			//cout << "re " << re << endl;
		}
		

		s+=su[i];
	}
	return re;
}
int main(){
	cin.sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	f = vector<i64>(n);
	for(int i = 0; i < n; ++i){
		cin >> f[i];
		i64 hb1 = hb(f[i]);
		su[hb1]+=f[i];
		pir[hb1].insert(f[i]);
		//cout << f[i] << " " << hb1 << endl;
	}
	
	cout << rip() << endl;
	int m; cin >> m;
	for(int i = 0; i < m; ++i){
		cin >> k[i] >> cf[i];
		k[i]--;
		i64 hb1 = hb(f[k[i]]);
		pir[hb1].erase(pir[hb1].find(f[k[i]]));
		su[hb1]-=f[k[i]];
		f[k[i]] = cf[i];
		hb1 = hb(cf[i]);
		pir[hb1].insert(cf[i]);
		su[hb1]+=cf[i];
		//cout <<" hb" << cf[i] << " " << hb1 << endl;
		cout << rip() << endl;
	}
	return 0;
	
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED

Test 36

Verdict: ACCEPTED

Test 37

Verdict: ACCEPTED

Test 38

Verdict: ACCEPTED

Test 39

Verdict: ACCEPTED

Test 40

Verdict: ACCEPTED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: ACCEPTED

Test 43

Verdict: ACCEPTED

Test 44

Verdict: ACCEPTED

Test 45

Verdict: ACCEPTED

Test 46

Verdict: ACCEPTED

Test 47

Verdict: ACCEPTED

Test 48

Verdict: ACCEPTED

Test 49

Verdict: ACCEPTED

Test 50

Verdict: ACCEPTED

Test 51

Verdict: ACCEPTED

Test 52

Verdict: ACCEPTED

Test 53

Verdict: ACCEPTED

Test 54

Verdict: ACCEPTED

Test 55

Verdict: ACCEPTED

Test 56

Verdict: ACCEPTED

Test 57

Verdict: ACCEPTED

Test 58

Verdict: ACCEPTED

Test 59

Verdict: ACCEPTED

Test 60

Verdict: ACCEPTED

Test 61

Verdict: ACCEPTED

Test 62

Verdict: ACCEPTED

Test 63

Verdict: ACCEPTED

Test 64

Verdict: ACCEPTED

Test 65

Verdict: ACCEPTED

Test 66

Verdict: ACCEPTED

Test 67

Verdict: ACCEPTED

Test 68

Verdict: ACCEPTED

Test 69

Verdict: ACCEPTED

Test 70

Verdict: ACCEPTED

Test 71

Verdict: ACCEPTED

Test 72

Verdict: ACCEPTED

Test 73

Verdict: ACCEPTED

Test 74

Verdict: ACCEPTED