提出 #71010732

---

ソースコード 拡げる

/*
*            /$$           /$$
*           |__/          |__/
*  /$$$$$$$$ /$$ /$$$$$$$$ /$$  /$$$$$$
* |____ /$$/| $$|____ /$$/| $$ /$$__  $$
*    /$$$$/ | $$   /$$$$/ | $$| $$  \ $$
*   /$$__/  | $$  /$$__/  | $$| $$  | $$
*  /$$$$$$$$| $$ /$$$$$$$$| $$|  $$$$$$$
* |________/|__/|________/|__/ \____  $$
*                                   | $$
*                                   | $$
*                                   |__/
*/
//hj23308±£ÓÓÎÒ
//Missile±£ÓÓÎÒ
/*
* ÐÑÁËÔÚÃÎÀïÕõÔú£¬²»¾õ÷öµ­Á˳¯Ï¼
*/
/*
* ÎҺܸßÐËÄãûÓÐÍüÁËÎÒ£¬µ«ÊÇÎÒÏÖÔÚ¸üÏ£ÍûÄãÒѾ­ÍüÁËÎÒÁË¡£
* Ï£ÍûÔÚÄãµÄ¼ÇÒäÖУ¬ÎÒÖ»Êdz¾ÍÁÒ»´é£¬´ÓÄãµÄÈ«ÊÀ½ç·¹ý£¬È»ºóËÄÉ¢·ÉÑï²»ÁôÏÂÒ»µãºÛ¼££¬¶øÄãÒª²»»ØÍ·µÄÍùÇ°×ß¡£
* ÎÒ¸üÏ£ÍûÎÒÖ»ÊÇ´ÓÄãµÄÈ«ÊÀ½ç·¹ý£¬Ö»ÊÇ·¹ý
*/
/*
* Ö»ÊÇÎÒÔÚÊ®×Ö·¿ÚÊØÁËÌ«¾Ã£¬Êص½»ÆɳÈçÓêÑÚÂñÒ»Çкۼ££¬²Å·¢ÏÖ×Ô¼ºµÈµÄÈËÒѾ­À뿪ÁË¡£
*/
/*
* ÌýÎÒµÄ ±ð»ØÍ· »ØÍ·¾Í¿ÉÄÜ»áÀáÁ÷ÂúÃ棬»á±»»ÆɳÑÚÂñ£¬ËùÒÔ¼´Ê¹Í´¿àÒ²ÒªÏòÇ°×ß
*/
/*
* ÎÒÌýµ½ÁË¡¸ÌìÐн¡¡¹µÄ»ØÏ죬ÕâÊÇÒ»¸öΰ´ó¶·Ê¿µÄ²»Ï¢×ÔÇ¿£»
* ÎÒÌýµ½ÁË¡¸ÆÆÍò·¨¡¹µÄ»ØÏ죬ÕâÊÇÒ»¸öºÚµÀ´òÊÖµÄÊØ»¤ÓûÍû£»
* ÎÒ¿´¼ûÁË¡¸ÉúÉú²»Ï¢¡¹µÄ¼¤µ´£¬ÕâÊÇÒ»¸öÆ­×ÓµÄΰ´óÀÖÕ£¡
*/
/*
* ÎÒÓÃÐé¼ÙµÄÃæ¾ßÕÕ¹Ë×ÅϸÄåµÄ¸ÐÇ飻
* ÎÒÒÔ»ªÀöµÄÒÂÎïϲØן¯ÀõÄѪÈ⣻
* µ±ÎÒÕªÏÂÃæ¾ß£¬ÍÊÈ¥ÒÂÎ¼´±ãÊÇÎÒ×îÇ×½üµÄÈË£¬Ò²ÎÞ·¨Ö±ÊÓÎÒ
*/
#include<bits/stdc++.h>
#define mk make_pair
using namespace std;
mt19937 engine(chrono::steady_clock().now().time_since_epoch().count());
const int MAXN=2e5+5;
int n,m,q;
long long ans;
int a[MAXN],b[MAXN];
multiset<int>A,B,C;
void init()
{
	while(int(A.size())<(n/2)) {
		ans+=(*B.begin());
		A.emplace(*B.begin());
		B.erase(B.begin());
	}
	while(int(C.size())<(n/2)) {
		ans+=(*B.rbegin());
		C.emplace(*B.rbegin());
		B.erase(prev(B.end()));
	}
	while(*A.rbegin()>(*B.begin())) {
		int x=*A.rbegin(),y=*B.begin();
		ans-=x,ans+=y;
		A.erase(A.find(x)),B.erase(B.find(y));
		A.emplace(y),B.emplace(x);
	}
	while(*C.begin()<(*B.rbegin())) {
		int x=*C.begin(),y=*B.rbegin();
		ans-=x,ans+=y;
		C.erase(C.find(x)),B.erase(B.find(y));
		C.emplace(y),B.emplace(x);
	}
}
void Modify(int x,int y)
{
	if(A.find(x)!=A.end()) ans-=x,A.erase(A.find(x));
	else if(B.find(x)!=B.end()) B.erase(B.find(x));
	else if(C.find(x)!=C.end()) ans-=x,C.erase(C.find(x));
	B.emplace(y);
	init();
}
int main()
{
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	std::ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	cin>>n>>m>>q;
	for(int i=1;i<=n;i++) {
		cin>>a[i];
		B.emplace(a[i]);
	}
	for(int i=1;i<=m;i++) {
		cin>>b[i];
		B.emplace(b[i]);
	}
	init();
	while(q--) {
		int opt,pos,val;
		cin>>opt>>pos>>val;
		if(opt==1) {
			Modify(a[pos],val);
			a[pos]=val;
		}
		else {
			Modify(b[pos],val);
			b[pos]=val;
		}
		cout<<ans<<"\n";
	}
	return 0;
}

提出情報

ジャッジ結果