注意撤销也是一条记录还有记录的编号从1开始
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 5010;
struct node
{
int type;
double p;
ll s;
bool is_del;
}a[N];
int main()
{
int n = 0;
string type;
while(cin>>type)
{
if(type == "buy")
{
double p;
ll s;
cin>>p>>s;
a[n++] = {1,p,s};
}
else if(type == "sell")
{
double p;
ll s;
cin>>p>>s;
a[n++] = {2,p,s};
}
else
{
int id;
cin>>id;
a[id-1].is_del = true;
a[n++].is_del = true;//***撤销也是一条记录***
}
}
double ans_p ;
ll ans_s = 0;
for(int i=0;i<n;i++)
{
if(a[i].is_del == false)
{
ll s1 = 0,s2 = 0;
for(int j=0;j<n;j++)
{
if(a[j].is_del == false )
{
if(a[j].type == 1 && a[j].p >= a[i].p) s1 += a[j].s;
else if(a[j].type == 2 && a[j].p <= a[i].p) s2 += a[j].s;
}
ll t = min(s1,s2);
if(t > ans_s || t==ans_s&&a[i].p>ans_p)
ans_p = a[i].p , ans_s = t;
}
}
}
printf("%.2lf %lld\n",ans_p,ans_s);
return 0;
}