We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. C++
  3. STL
  4. Maps-STL
  5. Discussions

Maps-STL

Sort by

recency

|

321 Discussions

|

  • yashdeora98294
     + 0 comments

    Here is Maps-STL problem solution in C++ - https://programmingoneonone.com/hackerrank-maps-stl-solution-in-cpp.html

  • jeelpatel779
     + 0 comments
    #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <map>
using namespace std;


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int t;
    cin>>t;
    map<string,int>mp;
    while(t--){
        int a;
        cin>>a;
        string s;
        cin>>s;
        if(a==1){
            int marks;
            cin>>marks;
            auto it=mp.find(s);
            if(it!=mp.end()){
                mp[s]+=marks;
            }else{
                mp.insert(make_pair(s,marks));
            }
        }
        if(a==2){
            mp.erase(s);
        }
        if(a==3){
            if(mp.find(s)!=mp.end()){
                cout<<mp[s]<<endl;
            }else{
                cout<<0<<endl;
            }
        }
    }
    return 0;
}

  • jeelpatel779
     + 0 comments

    include

    include

    include

    include

    include

    include

    using namespace std;

    int main() { /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    int t; cin>>t; mapmp; while(t--){ int a; cin>>a; string s; cin>>s; if(a==1){ int marks; cin>>marks; auto it=mp.find(s); if(it!=mp.end()){ mp[s]+=marks; }else{ mp.insert(make_pair(s,marks)); } } if(a==2){ mp.erase(s); } if(a==3){ if(mp.find(s)!=mp.end()){ cout<

  • jeelpatel779
     + 0 comments

    include

    include

    include

    include

    include

    include

    using namespace std;

    int main() { /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    int t; cin>>t; mapmp; while(t--){ int a; cin>>a; string s; cin>>s; if(a==1){ int marks; cin>>marks; auto it=mp.find(s); if(it!=mp.end()){ mp[s]+=marks; }else{ mp.insert(make_pair(s,marks)); } } if(a==2){ mp.erase(s); } if(a==3){ if(mp.find(s)!=mp.end()){ cout<

  • buivanchung22109
     + 0 comments

    //M.Kohaku

    include

    using namespace std;

    int main(){ int truyvan,diem; mapdiemthisinh; string ten; int n; cin >> n; for(int i=0;i> truyvan; if(truyvan==1){ cin >> ten >> diem; diemthisinh[ten] += diem; } else if(truyvan==2){ cin >> ten; diemthisinh.erase(ten); } else if(truyvan==3){ cin >> ten; if(diemthisinh.find(ten)!=diemthisinh.end()){ cout << diemthisinh[ten] << endl; } else cout << 0 << endl; } } }