pypy3(pypy3.6.1) 解法, 执行用时: 6276ms, 内存消耗: 33208K, 提交时间: 2020-02-22 21:09:54

from queue import PriorityQueue

pq=PriorityQueue()

mp={}
T=int(input())
for k in range(T):
	s=input().split()
	if(len(s)==1):
		tmp=int(s[0])
		if tmp==-1:
			if len(mp)==0:
				print("skipped")
			else:
				kk=pq.get()
				print(mp[kk])
				mp.pop(kk)
		else:
			if tmp in mp.keys():
				print(mp[tmp])
			else:
				print(0)
	else:
		tmp1=int(s[0])
		tmp2=int(s[1])
		flg=0
		for i in range(tmp1-30,tmp1+31):
			if i in mp.keys():
				flg=1
				break
		if flg==0:
			if tmp1 in mp.keys():
				mp[tmp1] += tmp2
			else:
				mp[tmp1]=tmp2
				pq.put(tmp1)

C++11(clang++ 3.9) 解法, 执行用时: 282ms, 内存消耗: 8312K, 提交时间: 2020-04-22 16:26:36

#include <bits/stdc++.h>

using namespace std;

int n;
map<int, int> mp;

int main(){
	scanf("%d", &n);
	while(n--){
		int p, x;
		scanf("%d", &p);
		if(getchar() == '\n'){
			if(~p) mp.count(p) ? printf("%d\n", mp[p]) : puts("0");
			else{
				if(mp.size()) printf("%d\n", mp.begin()->second), mp.erase(mp.begin());
				else puts("skipped");
			}
		}
		else{
			scanf("%d", &x);
			auto pos = mp.lower_bound(p - 30);
			if(pos == mp.end() || pos->first > p + 30) mp[p] = x;
		}
	}
}

C++14(g++5.4) 解法, 执行用时: 301ms, 内存消耗: 2012K, 提交时间: 2020-02-24 17:04:57

#include<cstdio>
#include<map>
using namespace std;
map<int,int> a;
int main(){
	int n;
	scanf("%d",&n);
	for (int t,c;n;n--){
		scanf("%d",&t);
		if (getchar()=='\n'){
			if (t==-1){
				if (a.empty()) puts("skipped");
				else printf("%d\n",a.begin()->second),a.erase(a.begin());
			}
			else {
				if (a.count(t)) printf("%d\n",a[t]);
				else puts("0");
			}
		}else{
			scanf("%d",&c);
			auto pos=a.lower_bound(t-30);
			if (pos==a.end() || pos->first>t+30) a[t]=c;
		}
	}
}