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
#include <bits/stdc++.h>
using namespace std;

#define zzz 524287
#define pocz1 524288
#define kon1 1048575

long long tab[500017];
long long drzewo[1048585];
long long pref[500017];
long long drzewo_sum[1048585];
bool drzewo_wp[1048585];

long long ter = 0;
int N,M;

void zmien(int j,int a,int b,long long war,long long czynz,long long trzeba = -1,int oa = pocz1,int ob = kon1)
{
	printf("%d %d %d %d %d\n",j,a,b,oa,ob);
	a = max(a,oa);
	b = min(b,ob);
	if (b < a)
		return;
	if (oa == a && ob == b)
	{
		//printf("ZMIANA W %d\n",j);
		drzewo[j] = war;
		drzewo_sum[j] = (b-a+1)*czynz;
		drzewo_wp[j] = true;
		return;
	}
	else if (oa <= a && ob >= b)
	{
		if (trzeba == -1)
			trzeba = drzewo[j];
		zmien(j*2,a,b,war,czynz,trzeba,oa,(oa+ob)/2);
		zmien((j*2)+1,a,b,war,czynz,trzeba,((oa+ob)/2)+1,ob);
		drzewo_sum[j] = drzewo_sum[j*2]+drzewo_sum[(j*2)+1];
		drzewo_wp[j] = false;
		drzewo[j] = -1;
		return;
	}
	if
	 (trzeba != -1)
		drzewo[j] = trzeba;
	return;
}

long long suma(int j,int a,int b,int oa = pocz1,int ob = kon1)
{
	a = max(a,oa);
	b = min(b,ob);
	if (b < a)
		return 0;
	if (oa == a && ob == b && drzewo[j] != -1)
	{
		//printf("DODANO W -> %lld %lld (%lld * %lld) %lld\n",drzewo[j],((ter-drzewo[j])*(pref[b-zzz]-pref[a-1-zzz])),ter-drzewo[j],pref[b-zzz]-pref[a-1-zzz],drzewo_sum[j]);
		return ((ter-drzewo[j])*(pref[b-zzz]-pref[a-1-zzz]))+drzewo_sum[j];
	}
	else if (oa <= a && ob >= b)	
	{
		if (drzewo[j] != -1)
		{
			drzewo[j*2] = drzewo[j];
			drzewo[(j*2)+1] = drzewo[j];
		}
		if (drzewo_wp[j])
		{
			drzewo_sum[j*2] = drzewo_sum[j]/2;
			drzewo_sum[(j*2)+1] = drzewo_sum[j]/2;
			drzewo_wp[j*2] = true;
			drzewo_wp[(j*2)+1] = true;
		}
			
		return suma(j*2,a,b,oa,(oa+ob)/2)+suma((j*2)+1,a,b,((oa+ob)/2)+1,ob);
			
	}
	return 0;
}

inline long long sum(int a,int b)
{
	return suma(1,a+zzz,b+zzz);
}

inline void zmiana(int a,int b,long long c,long long d)
{
	zmien(1,a+zzz,b+zzz,c,d);
}

int binsercz(long long a)
{
	int pocz = 0;
	int kon = N+1;
	int sr = 0;
	while (pocz != kon-1)
	{
		sr = (kon+pocz)/2;
		if (sum(sr,sr) > a)
			kon = sr;
		else
			pocz = sr;
	}
	return kon;
}

int main()
{
	scanf("%d%d",&N,&M);
	for (int i = 1;i <= N;i++)
	{
		scanf("%lld",&tab[i]);
	}
	sort(tab+1,tab+(N+1));
	for (int i = 1;i <= N;i++)
	{
		pref[i] = pref[i-1]+tab[i];
	}
	
	long long d,wys;
	long long trzeba = pref[N];
	long long tersum = 0;
	long long presum = 0;
	int krzysio;
	while (M--)
	{
		scanf("%lld%lld",&d,&wys);
		ter = d;
		presum = sum(1,N);
		/*for (int i = 1;i <= N;i++)
		{
			printf("%lld ",sum(i,i));
		}
		printf("\n");
		for (int i = 1;i < 16;i++)
		{
			printf("%lld ",drzewo_sum[i]);
		}
		printf("\n");*/
		krzysio = binsercz(wys);
		//printf("WRZUCAM %d %d LICZBE %lld\n",krzysio,N,wys);
		zmiana(krzysio,N,d,wys);
		tersum = sum(1,N);
		printf("%lld\n",max((long long) 0,presum-tersum));
	}
	
	return 0;
}