有没有dalao解救一下蒟蒻的码风

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1e5+10; 
ll x[N];
ll d[N],cnt[N];
int main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	ll n=0;
	while(cin>>x[n]){
		n++;
	}
	ll s;
	ll Acnt=0;
	for(s=1;s<=n;s++){
		*lower_bound(d+1,d+Acnt+1,x[s])=x[s];
		cnt[lower_bound(d+1,d+Acnt+1,x[s])-d]++;
		if(lower_bound(d+1,d+Acnt+1,x[s])-d==Acnt+1){
			Acnt++;
		}
	}
	cout<<*max_element(cnt+1,cnt+Acnt+1)<<endl<<Acnt;
	return 0;
}

using namespace std;
typedef long long ll;
struct H{
    ll He,Li;
};
const ll Be=5e3+10;
H B[Be];
bool F(H Ne,H Na){
    return Ne.He<Na.He;
}
int main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	ll C,N;
    cin>>C>>N;
    ll O;
    for(O=1;O<=N;O++){
        cin>>B[O].He>>B[O].Li;
    }
    sort(B+1,B+N+1,F);
    O=1;
    ll Mg=0,Al=0;
    while(Al+B[O].Li<=C && O<=N){
        Mg+=B[O].He*B[O].Li;
        Al+=B[O].Li;
        O++;
    }
    cout<<Mg+(C-Al)*B[O].He;
	return 0;
}