第 71 场双周赛

#define pb push_back
class Solution {
public:
    int minimumSum(int num) {
        vector<int> p;
        while(num){
            p.pb(num%10),num/=10;
        }
        sort(p.begin(),p.end());
        int res=p[0]*10+p[2]+p[1]*10+p[3];
        return res;
    }
};//2239

#define pb push_back
class Solution {
public:
    vector<int> pivotArray(vector<int>& nums, int pivot) {
        vector<int> ans;
        for(auto i:nums){
            if(i<pivot) ans.pb(i);
        }
        for(auto i:nums){
            if(i==pivot) ans.pb(i);
        }
        for(auto i:nums){
            if(i>pivot) ans.pb(i);
        }
        return ans;
    }
};

按常规套路枚举整除60取模60得到分钟和秒~

const int inf = 0x3f3f3f3f;
class Solution {
public:
    int minCostSetTime(int startAt, int moveCost, int pushCost, int targetSeconds) {
        int ans=inf;
        vector<int> p;
        for(int i=0;i<=99;i++){  // 枚举秒 
            if((targetSeconds-i)%60==0&&i<=targetSeconds){
                int res=(targetSeconds-i)/60;
                if(res>99) continue;
                int a=res,b=i;
//                cout<<"("<<a<<" "<<b<<"):";
                p.clear();
                
                while(b) p.push_back(b%10),b/=10;
                while(p.size()<2) p.push_back(0);
                while(a) p.push_back(a%10),a/=10;
                reverse(p.begin(),p.end());
                
//                for(auto k:p) cout<<k<<" ";cout<<"over";
                int st = startAt;
                int num=0,f=1;
                for(int j=0;j<p.size();j++){
                    if(f){
                        if(p[j]){
                            f=0;
                        }else{
                            continue;
                        }
                    }
                    if(p[j]==st){
                        num+=pushCost;
                    }else{
                        num+=moveCost+pushCost;
                        st=p[j];
                    }
                }
                ans=min(ans,num);
//                cout<<num<<endl;        
            }
        }
        return ans;
    }
};

枚举分割点 + 优先队列

const int N = 2e6+100 ;
typedef long long ll;
#define pb push_back
priority_queue<int,vector<int>,less<int> > q;
priority_queue<int,vector<int>,greater<int> > p;
ll a[N],b[N];
class Solution {
public:
    long long minimumDifference(vector<int>& nums){
        while(q.size()) q.pop();
        while(p.size()) p.pop();
        int m=nums.size();int n=m/3;
        ll s=0;
        for(int i=0;i<n;i++) q.push(nums[i]),s+=nums[i];
        a[n-1]=s;
        for(int i=n;i<m;i++){
            if(nums[i]<q.top()){
                s-=q.top();
                s+=nums[i];
                q.pop();
                q.push(nums[i]);
            }
            a[i]=s;
        }
        s=0;
        for(int i=m-1;i>=m-n;i--) p.push(nums[i]),s+=nums[i];
        b[m-n]=s;
        for(int i=m-n-1;i>=0;i--){
            if(nums[i]>p.top()){
                s-=p.top();
                s+=nums[i];
                p.pop();
                p.push(nums[i]);
            }
            b[i]=s;
        }
        ll ans=a[n-1]-b[n];
        for(int i=n;i<2*n;i++){
            ans=min(ans,a[i]-b[i+1]);
        }
        return ans;
    }
};