AtCoder Beginner Contest 212 D

题目

傻了，其实就像noip2017蚯蚓那题维护就行了。那怎么取最小呢，就用优先队列呀，干嘛一定要用队列呢，那对所有元素add该怎么办呢，那就对所有后面来的元素都减呀，根据相对论，我不动，你减，那不就等于我加了嘛。

#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define fr first
#define sc second
#define P pair<int,int>
#define m_p make_pair
#define pb push_back
typedef long long ll;
using namespace std;

signed main(){
    priority_queue<ll, vector<ll>, greater<ll> >pq;
    ll sum=0;
    int t;
    cin>>t;
    while(t--){
    	ll x;
    	cin>>x;
    	if(x==1){
    		ll y;
    		cin>>y;
    		pq.push(y-sum);
		}
		if(x==2){
			ll y;
			cin>>y;
			sum+=y;
		}
		if(x==3){
			ll y=pq.top();
			pq.pop();
			cout<<y+sum<<endl;
		}
	}
	return 0;
}