AcWing 3209. 第3次csp认证 题目3 集合竞价
原题链接
简单
作者:
Misty.
,
2023-12-03 19:26:39
,
所有人可见
,
阅读 53
#include<iostream>
#include<cstdio>
using namespace std;
int n;
struct record
{
int type;
double p;
int s;
bool is_del;
}d[5010];
int main()
{
string type;
while(cin>>type)
{
if(type=="buy")
{
double p;
int s;
cin>>p>>s;
d[++n]={1,p,s};
}
else if(type=="sell")
{
double p;
int s;
cin>>p>>s;
d[++n]={2,p,s};
}
else
{
int id;
cin>>id;
d[id].is_del=1;
d[++n].is_del=1;
}
}
double resp=0; //价格
long long ress=0; //成交数量
for(int i=1;i<=n;i++)
{
if(d[i].is_del==0)
{
double p=d[i].p;
long long s1=0,s2=0;
for(int j=1;j<=n;j++)
{
if(!d[j].is_del)
{
if(d[j].type==1&&d[j].p>=p) s1+=d[j].s; //buy
else if(d[j].type==2&&d[j].p<=p) s2+=d[j].s; //sell
}
}
long long t=min(s1,s2);
if(t>ress||t==ress&&p>resp)
resp=p,ress=t;
}
}
printf("%.2lf %lld\n", resp, ress);
return 0;
}