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

|

315 Discussions

|

  • varsha83mishra
     + 0 comments

    map map1; string x; int n,k,y; cin>>n; while(n--){ cin>>k; if(k==1){ cin>>x; cin>>y; if(map1.count(x)==1){ y+=map1[x]; map1[x]=y; }else{
    map1[x]=y; } } else if(k==2){ cin>>x; map1[x]=0; } else if(k==3){ cin>>x; cout<

  • wazirzoh1
     + 0 comments
    map<string,int> studentMarks;
int n,query,marks;
cin >> n;
string name;

for(int i=0; i<n; ++i){
    cin >> query;

    if(query == 1){
        cin >> name >> marks;
        studentMarks[name] += marks;
    }
    else if(query == 2){
        cin >> name;
        studentMarks.erase(name);
    }
    else if(query == 3){
        cin >> name;
        if(studentMarks.find(name) != studentMarks.end()){
            cout << studentMarks[name];
        }
        else{
            cout << 0;
        }
    }
}

  • abhiogs09
     + 0 comments
    int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int q_no, q_type, marks;
    string name;
    map<string, int> m;
    map<string, int>::iterator it;
    
    cin >> q_no;
    
    while(q_no){
        cin >> q_type;
        switch(q_type){
            case 1:
                cin >> name >> marks;
                it = m.find(name);
                if(it != m.end()){
                    m[name] += marks;
                }
                else{
                    m.insert(make_pair(name, marks));    
                }               
                break;
            case 2:
                cin >> name;
                m[name] = 0;
                break;
            case 3:
                cin >> name;
                it = m.find(name);
                (it != m.end()) ? cout<< m[name] << endl : cout<< 0 << endl;
                break;
        }
        
        q_no--;
    }
    
    return 0;
}

  • Ayushaote
     + 0 comments
    int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int n;
    int query;
    map<string, int> students;
    cin>>n;
    string name;
    int marks;
    for(int i=0;i<n;i++)
    {
        cin>>query;
        if(query==1)
        {
            cin>>name>>marks;
            students[name]+=marks;
        }
        if(query==2 || query==3)
        {
            cin>>name;
        }
        switch(query)
    {
        case 1: 
        students.insert(make_pair(name,marks)); 
        break;
        
        case 2:
        students.erase(name);
        break;
        
        case 3:
        cout<<students[name]<<"\n";
        break;
    }
    
}
    return 0;
}

  • poonamdeorasurp1
     + 0 comments

    Here is - hackerrank maps - stl problem solution