UVA 10420 - List of Conquests UVA • Sep 1, 2020 Problem PDFSolution:#include #include #include #include #include #include #include #include #include #include #include #include #define ll long long #define sc scanf #define pf printf #define Pi 2*acos(0.0) using namespace std; int main() { int n; vectorv; mapmp; string s,a; cin>>n; getchar(); while(n--) { cin>>s; getchar(); getline(cin,a); if(mp[s]) { mp[s]++; } else { mp[s]++; v.push_back(s); } } sort(v.begin(),v.end()); for(int i=0;ihttps://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/10420/10420.cpp Tags UVA Competitive Programming Shipu Ahamed Recommended for you UVA UVA 913 - Joana and the Odd Numbers 4 years ago • 1 min read UVA UVA 871 - Counting Cells in a Blob 4 years ago • 3 min read UVA UVA 866 - Intersecting Line Segments 4 years ago • 3 min read