map< 番地の型, 記録する型 > a;
a.clear() (初期化)
アクセスの計算量は O(logN)
2分探索の必要がないため、lower_boundと使うと速い
map<string, int> Map;
Map["algorithm"] = 1111;
cout << Map["algorithm"] << endl;
More than 1 year has passed since last update.
Register as a new user and use Qiita more conveniently
- You get articles that match your needs
- You can efficiently read back useful information
- You can use dark theme