Submission #1306229

---

Source Code Expand

#include<iostream>
#include <string>
#include <iomanip>
#include <vector>
#include <queue>
using namespace std;
#define int long long
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define REP(i,n) for (int i=0;i<(n);i++)


signed main()
{
	int r, c;
	int sx, sy, gx, gy, x, y, tar_x, tar_y;
	int array1[3];
	int *array2;
	int cc = 0;
	vector<string> name;
	vector<int> name_count;
	int name_count_max = 0;
	string name_tmp;
	string max_name;
	bool ex = false;
	cin >> r;
	name.resize(r, "0");
	name_count.resize(r, 0);
	for (int i = 0; i < r; i++){
		cin >> name_tmp;
		ex = false;
		cc += 1;
		for (int j = 0; j < cc; j++)
		{
			if (name[j] == name_tmp){
				name_count[j] += 1;
				ex = true;
				if (name_count_max < name_count[j]){
					name_count_max = name_count[j];
					max_name = name[j];
				}
			}
		}
		if (ex == false){
			name[i] = name_tmp;
		}
	}
	cout << max_name << endl;
	return 0;
}

Submission Info

Judge Result