differentNames.cpp

// Different Names

// In Little Flowers Public School, there are many students with same first names. You are given a task to find the students with same names. You will be given a string comprising of all the names of students and you have to tell the name and count of those students having same. If all the names are unique, print -1 instead.
// Note: We don't have to mention names whose frequency is 1.

// Input Format:
// The only line of input will have a string ‘str’ with space separated first names of students.

// Output Format:
// Print the names of students along with their count if they are repeating. If no name is repeating, print -1

// Constraints:

// 1 <= |str| <= 10^5
// Time Limit: 1 second

// Sample Input 1:

// Abhishek harshit Ayush harshit Ayush Iti Deepak Ayush Iti

// Sample Output 1:

// harshit 2
// Ayush 3
// Iti 2

#include<bits/stdc++.h>
using namespace std;
int main()
{
    string s;
    getline(cin, s);
    
    vector<string> names;
    string name = "";
    for(int i = 0; i < s.length(); i++)
    {
        if(s[i] == ' ')
        {
            names.push_back(name);
            name = "";
            continue;
        }
        
        name = name + s[i];        
    }
    names.push_back(name);
    
    map<string, int> freq;
    
    for(int i = 0; i < names.size(); i++)
    {
        freq[names[i]]++;
    }
    
    bool unique = true;
    map<string, int> :: iterator itr;
    for(itr = freq.begin(); itr != freq.end(); itr++)
    {
        if(itr->second != 1)
        {
        	unique = false;
            cout << itr->first << " " << itr->second << endl;
        }
    }

    if(unique)
    {
        cout << -1 << endl;
    }
    
    
	return 0;
}