蒟蒻刚学OI 0.114514ms,求条qwq
查看原帖
蒟蒻刚学OI 0.114514ms,求条qwq
1414683
_Blood__Stringer_楼主2024/11/6 20:19
#include<bits/stdc++.h>
//#define int long long
#define debug puts("qwq");
#define inf 0x3f3f3f3f
#define infi 0x3f3f3f3f3f3f3f3fll
#define up(i,x,y) for(register int i=x;i<=y;++i)
#define dn(i,x,y) for(register int i=x;i>=y;--i)
using namespace std;
inline int read(){int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();return x*f;}
inline void write(int x){if(x<0)putchar('-'),x=-x;if(x>9)write(x/10);putchar(x%10|48);}
inline void writeln(int x){write(x),putchar('\n');}
inline void writesp(int x){write(x),putchar(' ');}
inline void fre(){freopen(".in","r",stdin),freopen(".out","w",stdout);}
priority_queue<int,vector<int>,less<int> >KthDeap;
priority_queue<int,vector<int>,greater<int> >OthDeap;
signed main(){
//	fre();
	int n=read();
	up(i,1,n){
		OthDeap.push(read());
		if(i&1){
			int k=OthDeap.top();
			KthDeap.push(k),OthDeap.pop();
			writeln(KthDeap.top());
		}
	}return 0;
}

附一问:CSP-S 164pts 拿蓝√的概率有多大?

2024/11/6 20:19
加载中...