每天打卡一小时 第三十天 贪心算法

 

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
#include<bits/stdc++.h>
using namespace std;
 
int findContentChildren(vector<int>& children, vector<int>& cookies);
 
int main()
{
    int n;
    cin>>n;
    vector<int> children(n);
    for(int i=0;i<n;i++)
    {
        if(!(cin>>children[i]))
        {
            cout<<"invalid input"<<endl;
            return 0;
        }
    }
     
    int m;
    cin>>m;
    vector<int> cookies(m);
    for(int i=0;i<m;i++)
    {
        if(!(cin>>cookies[i]))
        {
            cout<<"invalid input"<<endl;
            return 0;
        }
    }
     
    cout<<findContentChildren(children, cookies);
     
}
 
int findContentChildren(vector<int>& children, vector<int>& cookies)
{
    sort(children.begin(), children.end());
    sort(cookies.begin(), cookies.end());
    int child = 0, cookie = 0;
    while (child < children.size() && cookie < cookies.size())
    {
        if (children[child] <= cookies[cookie])
            ++child;
        else
            ++cookie;
    }
    return child;
}

  

posted @   财神给你送元宝  阅读(17)  评论(0编辑  收藏  举报
相关博文:
阅读排行:
· Manus重磅发布:全球首款通用AI代理技术深度解析与实战指南
· 被坑几百块钱后,我竟然真的恢复了删除的微信聊天记录!
· 没有Manus邀请码?试试免邀请码的MGX或者开源的OpenManus吧
· 园子的第一款AI主题卫衣上架——"HELLO! HOW CAN I ASSIST YOU TODAY
· 【自荐】一款简洁、开源的在线白板工具 Drawnix
点击右上角即可分享
微信分享提示