题目链接:http://47.96.116.66/problem.php?id=1914
解题思路:
map<string,int> 从题名映射这是第几题
代码:
#include<iostream>
#include<map>
#include<string>
#include<algorithm>
#define ll long long
using namespace std;
map<string,int>mp;
const int N = 2e4+5;
ll dx[N],cs[N];
int main()
{
std::ios::sync_with_stdio(false);
int n,m;
cin >> n >> m;
string mmp;
for (int i=0;i<n;i++){
cin >> mmp >> cs[i];
mp[mmp] = i;
}
while (m--){
int op;
ll sb;
cin >> op >> mmp >> sb;
if (op==1){
dx[mp[mmp]] = max(dx[mp[mmp]],sb);
}
else {
cs[mp[mmp]] += sb;
}
}
int ans = 0;
for (int i=0;i<n;i++) if (dx[i]>=cs[i]) ans++;
printf("%d\n",ans);
return 0;
}