Submission #298619

#	Time	Username	Problem	Language	Result	Execution time	Memory
298619		YJU	Cake 3 (JOI19_cake3)	C++14	24 / 100	4083 ms	9828 KiB

cake3

#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=2e5+5;
const ld pi=3.14159265359;
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()

ll n,m,x,y,ans=-INF,sum=0;
multiset<ll> ms;
vector<pll> v;

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>n>>m;
	REP(i,n)cin>>x>>y,v.pb(mp(x,y));
	sort(v.begin(),v.end(),[](pll A,pll B){
		return (A.Y!=B.Y?A.Y<B.Y:(A.X>B.X));
	});
	REP(i,n){
		ms.clear();sum=0;
		for(int j=i;j<n;j++){
			if(SZ(ms)<m)sum+=v[j].X,ms.insert(v[j].X);
			else if(v[j].X>*ms.begin()){sum+=v[j].X-*ms.begin();ms.erase(ms.begin());ms.insert(v[j].X);}
			if(SZ(ms)==m){
				ans=max(ans,sum-2*(v[j].Y-v[i].Y));
			}
		}
	}
	cout<<ans<<"\n";
	return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 19 / 19
• Subtask 3: 0 / 76