Codeforces Round #239 (Div. 2) AB （水）

思路：两道水题

A：

#include<bits/stdc++.h>using namespace std;int a[105];int main(){    int n,ans,j,sum;scanf("%d",&n);for(int i = 1;i<=n;i++)scanf("%d",&a[i]);for(int i = 1;i<=n;i++){for(j = sum=0;j<a[i];j++){int tmp;scanf("%d",&tmp);sum+=tmp*5+15;}ans = min(ans,sum);}printf("%d\n",ans);}

B：

#include<bits/stdc++.h>using namespace std;map<char,int>vis;map<char,int>viss;char s[1010];int main(){    scanf("%s",s);    for(int i=0;i<strlen(s);i++)    {        vis[s[i]]++;        viss[s[i]]=1;    }    scanf("%s",s);int ans = 0;    for(int i = 0;i<strlen(s);i++)    {        if(vis[s[i]])        {            vis[s[i]]--;            ans++;        }        if(!viss[s[i]])        {            ans=0;            break;        }    }    printf("%d\n",ans==0?-1:ans);    return 0;}