# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1071849 | edogawa_something | Tricks of the Trade (CEOI23_trade) | C++17 | 513 ms | 760 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vii;
typedef pair<ll,ll> pii;
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define pb push_back
const ll M=6e3+10;
const ll inf=2e18;
ll n,k,a[M],b[M],c[M];
int main() {
ios_base::sync_with_stdio(0),cin.tie(0);
cin>>n>>k;
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n;i++)
cin>>b[i];
ll ans=-inf;
ll l,r;
for(int i=0;i<n;i++) {
ll nsum=0,psum=0;
priority_queue<ll,vii,greater<ll>>q;
for(int j=i;j<n;j++) {
nsum+=a[j];
if(q.size()<k)
q.push(b[j]),psum+=b[j];
else {
if(b[j]<q.top())
continue;
else
psum-=q.top(),q.pop(),q.push(b[j]),psum+=b[j];
}
if(q.size()==k) {
if(ans<psum-nsum) {
ans=max(ans,psum-nsum);
l=i,r=j;
}
}
}
}
ll cur=0;
ans=0;
for(int i=l;i<=r;i++)
ans-=a[i];
for(int j=0;j<k;j++) {
cur=0;
ll ind=0;
for(int i=l;i<=r;i++) {
if(b[i]>=cur)
cur=b[i],ind=i;
}
ans+=b[ind],b[ind]=-1;
}
cout<<ans<<'\n';
for(int i=0;i<n;i++) {
if(b[i]==-1)
cout<<1;
else
cout<<0;
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |