Submission #67001999

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
long long n,m,l,r,a[N*2+5],mid,ans,ans1;
bool cheak(int i)
{
	for(int j=i*2+1,z=2*n;j<=z;++j,--z) 
		if(a[j]+a[z]<m) return 1;
	return 0;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>m;
	for(int i=1;i<=2*n;++i)
		cin>>a[i];
	sort(a+1,a+n*2+1);
	l=0,r=n;
	while(l<=r)
	{
		mid=(l+r)/2;
		if(cheak(mid))
			l=mid+1;
		else
			r=mid-1,ans=mid;
	}
	for(int i=1,j=ans*2;i<=j;++i,--j)
		ans1=max(ans1,a[i]+a[j]-m*(a[i]+a[j]>=m));
	for(int i=ans*2+1,j=2*n;i<=j;++i,--j)
		ans1=max(ans1,a[i]+a[j]-m*(a[i]+a[j]>=m));
	cout<<ans1;
}

Submission Info

Submission Time
Task D - Match, Mod, Minimize
User billsans_sky
Language C++ 20 (gcc 12.2)
Score 0
Code Size 657 Byte
Status WA
Exec Time 23 ms
Memory 4964 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 700
Status
WA × 1
WA × 23
Set Name Test Cases
Sample sample-01.txt
All 01-01.txt, 01-02.txt, 01-03.txt, 01-05.txt, 01-06.txt, 01-07.txt, 02-01.txt, 02-02.txt, 02-03.txt, 03-01.txt, 03-02.txt, 03-03.txt, 03-04.txt, 03-05.txt, 04-01.txt, 04-02.txt, 05-01.txt, 05-02.txt, 05-03.txt, 05-04.txt, 05-05.txt, 05-06.txt, sample-01.txt
Case Name Status Exec Time Memory
01-01.txt WA 23 ms 4964 KiB
01-02.txt WA 17 ms 4604 KiB
01-03.txt WA 8 ms 3920 KiB
01-05.txt WA 2 ms 3452 KiB
01-06.txt WA 1 ms 3460 KiB
01-07.txt WA 1 ms 3516 KiB
02-01.txt WA 1 ms 3392 KiB
02-02.txt WA 1 ms 3600 KiB
02-03.txt WA 1 ms 3512 KiB
03-01.txt WA 1 ms 3456 KiB
03-02.txt WA 1 ms 3512 KiB
03-03.txt WA 1 ms 3592 KiB
03-04.txt WA 1 ms 3376 KiB
03-05.txt WA 1 ms 3324 KiB
04-01.txt WA 1 ms 3404 KiB
04-02.txt WA 1 ms 3464 KiB
05-01.txt WA 1 ms 3320 KiB
05-02.txt WA 1 ms 3452 KiB
05-03.txt WA 1 ms 3408 KiB
05-04.txt WA 1 ms 3464 KiB
05-05.txt WA 1 ms 3508 KiB
05-06.txt WA 1 ms 3452 KiB
sample-01.txt WA 1 ms 3448 KiB