7-14 电话聊天狂人 （25 分）

题目链接

java超内存一点

#include <iostream>
#include <cstdio>
#include <string>
#include <map>
using namespace std;
int main(){
    map<string,int> mp ;
    int n,maxn=-999;
    string str1,str2;
    string ansstr;
    int ansnum;
    int maxnnum=0;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>str1>>str2;
        mp[str1]++;
        mp[str2]++;
    }
    for(map<string,int>::iterator it = mp.begin();it!=mp.end();it++){
        if(maxn< it->second){
            ansstr = it->first;
            ansnum = it->second;
            maxn = it->second;
        }
    }
    for(map<string,int>::iterator it = mp.begin();it!=mp.end();it++){
        if(it->second == maxn){
            maxnnum++;
        }
    }
    cout<<ansstr<<" "<<ansnum;
    if(maxnnum>1){
        cout<<" "<<maxnnum<<endl;
    }
    else cout<<endl;
    return 0;
}

 

 

import java.io.*;
import java.util.*;

import javax.swing.undo.UndoableEdit;
import javax.xml.stream.util.EventReaderDelegate;


public class Main {
	/*static StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
	static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
	
	static int readInt() throws IOException{
		in.nextToken();
		return (int)in.nval;
	}
	static String readString() throws IOException{
		in.nextToken();
		return in.sval;
	}*/
	static Scanner in = new Scanner(System.in);
	static String s1;
	static String s2;
	static int maxn = -999;
	static int maxnum = 0;
	static int N;
	public static void main(String[] args) throws IOException {
		Map<String,Integer> mp = new TreeMap<String, Integer>();
		N = in.nextInt();
		for(int i=0;i<N;i++){
			s1 = in.next();
			s2 = in.next();
			if(mp.containsKey(s1)){
				mp.put(s1, mp.get(s1)+1);
			}
			else mp.put(s1, 1);
			if(mp.containsKey(s2)){
				mp.put(s2, mp.get(s2)+1);
			}
			else mp.put(s2, 1);

		}
		for(String key:mp.keySet()){
			if(maxn < mp.get(key)){
				maxn=mp.get(key);
			}
		}
		for(String key: mp.keySet()){
			if(maxn == mp.get(key)){
				maxnum++;
			}
		}
		for(String key: mp.keySet()){
			if(maxn == mp.get(key)){
				System.out.printf("%s %d",key,mp.get(key));
				break;
			}
		}
		if(maxnum > 1){
			System.out.printf(" %d\n",maxnum);
		}
	}
}