제출 #123160

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
123160		MvC	Cake 3 (JOI19_cake3)	C++11	24 / 100	4074 ms	9848 KiB

cake3

#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
//#include "rail.h"
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=2e5+50;
const int mod=1e9+7;
using namespace std;
int n,m,i,j,t;
pair<ll,ll>a[nmax];
vector<pair<ll,ll> >vc;
ll rs,ans=-llinf,mx,mn;
multiset<ll>s;
int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n>>m;
	for(i=1;i<=n;i++)cin>>a[i].sc>>a[i].fr;
	sort(a+1,a+n+1);
	for(i=1;i<=n;i++)
	{
		rs=0;
		for(j=i;j<=n;j++)
		{
			s.in(a[j].sc);
			rs+=a[j].sc;
			if(s.size()>m)
			{
				rs-=(*s.begin());
				s.er(s.begin());
			}
			if(s.size()==m)ans=max(ans,rs-2LL*(a[j].fr-a[i].fr));
		}
		s.clear();
	}
	cout<<ans<<endl;
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

cake3.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
cake3.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")
 
cake3.cpp: In function 'int main()':
cake3.cpp:43:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(s.size()>m)
       ~~~~~~~~^~
cake3.cpp:48:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(s.size()==m)ans=max(ans,rs-2LL*(a[j].fr-a[i].fr));
       ~~~~~~~~^~~

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