贪心

4340:

#include<iostream>
#include<cstdio>
#include<algorithm>
typedef unsigned long long ull;
using namespace std;
int n,cnt,m,x[101010],y[101010],ans,cntx=1,cnty=1;
int main(){
	cin>>n>>m;
	for(int i=1;i<n;i++) cin>>x[i];
	for(int i=1;i<m;i++) cin>>y[i];
	sort(x+1,x+n);
	sort(y+1,y+m);
	int l=n-1,r=m-1;
	while(l>0||r>0){
		if(x[l]>y[r]) ans+=x[l]*cnty,cntx++,l--;
		else ans+=y[r]*cntx,cnty++,r--;
	}
	cout<<ans;
}

#include<iostream>
#include<cstdio>
#include<algorithm>
typedef unsigned long long ull;
using namespace std;
int n,cnt,m,a[10101001];
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++) cin>>a[i];
	sort(a+1,a+n+1);
	int l=1,r=n;
	while(l<=r){
		r--,cnt++;
		if(a[l]+a[r]<=m) l++; 
	} 
	cout<<cnt;
}

赞赏