博丽神社的巫女（贪心）--牛客周赛 Round 37-B

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define inf 0x3f3f3f3f
const int mod=1e9+7;
const int N=2e5+5;
int n,m;
int a[N];
void solve(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	sort(a+1,a+n+1);
	int k=0;
	for(int i=1;i<=n;i++){
		if(a[i]>m){
			cout<<i-1<<" "<<m-a[i-1];
			return;
		}
	}
	cout<<n<<" "<<m-a[n];
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int tt=1;
//	cin>>tt;
	while(tt--) solve();
	return 0;
}