0分代码

#include<bits/stdc++.h>
#include<iostream>
#include<math.h>
#include<algorithm>
#include<queue>
#include<string>
#include<stack>
#define ll long long
#define itn int
#define nti int
#define nit int
#define tin int
#define tni int
using namespace std;
const int maxn=1010;
//char c[]={'a','b','c','d','e','f','g','h','i','j','k','l','n','m','o','p','q','r','s','t','u','v','w','x','y','z'};
ll a[1000010];
ll n,m,ans,p;
bool check(int x)
{
	ll sum;
	for(itn i=0;i<n;i++)
	{
		if(a[i]>x)
		    sum+=a[i]-x;
	}
	return sum>=m;
}
int main()
{
	cin>>n>>m;
	for(int i=0;i<n;i++) cin>>a[i];
	stable_sort(a,a+n);
	ll l=0,r=1000000000;
	while(l<=r)
	{
		int mid=(r+l)/2;
		if(check(mid))
		{
			ans=mid;
			l=mid+1;
		}
		else
		{
			r=mid-1;
		}
	}
	cout<<ans;
	return 0;
}

加了个

cout<<"";

竟然AC了！！

#include<bits/stdc++.h>
#include<iostream>
#include<math.h>
#include<algorithm>
#include<queue>
#include<string>
#include<stack>
#define ll long long
#define itn int
#define nti int
#define nit int
#define tin int
#define tni int
using namespace std;
const int maxn=1010;
//char c[]={'a','b','c','d','e','f','g','h','i','j','k','l','n','m','o','p','q','r','s','t','u','v','w','x','y','z'};
ll a[1000010];
ll n,m,ans,p;
bool check(int x)
{
	ll sum;
	for(itn i=0;i<n;i++)
	{
		if(a[i]>x)
		    sum+=a[i]-x;
	}
	return sum>=m;
}
int main()
{
	cin>>n>>m;
	for(int i=0;i<n;i++) cin>>a[i];
	stable_sort(a,a+n);
	ll l=0,r=1000000000;
	while(l<=r)
	{
		int mid=(r+l)/2;
		//cout<<"";
		if(check(mid))
		{
			ans=mid;
			l=mid+1;
		}
		else
		{
			r=mid-1;
		}
	}
	cout<<ans;
	return 0;
}

什么奇奇怪怪的东西？

有大佬给我解释一下吗？