P1324 矩形分割

解题思路：贪心。将所有需要切割的线从大到小排序，并且标记一下，是横轴还是竖轴。每一条线都是需要用到的，只是判断越大的应该切割的次数越小。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double lf;
typedef unsigned long long ull;
typedef pair<ll,int>P;
const int inf = 0x7f7f7f7f;
const ll INF = 1e16;
const int N = 1e5+10;
const ull base = 131;
const ll mod =  1e9+7;
const double PI = acos(-1.0);
const double eps = 1e-4;

inline int read(){
    
    int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){
    
    if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){
    
    x=x*10+ch-'0';ch=getchar();}return x*f;}
inline string readstring(){
    
    string str;char s=getchar();while(s==' '||s=='\n'||s=='\r'){
    
    s=getchar();}while(s!=' '&&s!='\n'&&s!='\r'){
    
    str+=s;s=getchar();}return str;}
int random(int n){
    
    return (int)(rand()*rand())%n;}
void writestring(string s){
    
    int n = s.size();for(int i = 0;i < n;i++){
    
    printf("%c",s[i]);}}
ll fast_power(ll a,ll p){
    
    
    ll ans = 1;
    while(p){
    
    
        if(p&1) ans = (ans*a)%mod;
        p >>= 1;
        a = (a*a)%mod;
    }
    return ans;
}

struct str{
    
    
    int flag;
    int num;
}a[N];

bool cmp(str a,str b){
    
    
    return a.num > b.num;
}
int main(){
    
    
    //srand((unsigned)time(NULL));
    //freopen(  "out.txt","w",stdout);
    int n = read()-1,m = read()-1;
    for(int i = 1;i <= n;i++){
    
    
        a[i].num = read();
        a[i].flag = 1;
    }
    for(int i = n+1;i <= n+m;i++){
    
    
        a[i].num = read();
        a[i].flag = 2;
    }
    int x = 1,y = 1;
    sort(a+1,a+1+n+m,cmp);
    ll ans = 0;
    for(int i = 1;i <= n+m;i++){
    
    
        if(a[i].flag == 1){
    
    
            ans += y*a[i].num;
            x++;
        }else {
    
    
            ans += x*a[i].num;
            y++;
        }
    }
    cout<<ans<<endl;
    return 0;
}