1348. 搭配牛奶难度: 简单 / 知识点: 贪心

Posted 2021-12-06 辉小歌

https://www.acwing.com/problem/content/1350/

#include<bits/stdc++.h>
using namespace std;
int n,m,a,b;
vector<pair<int,int>>ve;
int main(void)
{
    cin>>m>>n;
    for(int i=0;i<n;i++) cin>>a>>b,ve.push_back({a,b});
    sort(ve.begin(),ve.end());
    int sum=0;
    for(int i=0;i<ve.size();i++) 
        if(m>=ve[i].second) sum+=ve[i].second*ve[i].first,m-=ve[i].second;
        else 
        {
            sum+=m*ve[i].first;
            break;
        }
    cout<<sum;
    return 0;
}