2.构造:map <string,int> m1; 3.添加元素: m1["hello"]=5; //下标既能访问也能赋值也能添加,insert()添加效率高 insert(map<int, CString> :: value_type(2, "Two")) 4.常用函数: empty() size() clear() 迭代器 begin() , end(), erase() // m1.erase("hi"); m1.erase(it); m1.e...
成绩排序 第一关键字:成绩 第二关键字:输入的前后次序 #include<iostream>#include<algorithm>#include<cstring>#include<vector>usingnamespacestd;structStudent{string name;intscore;intid;};boolcmp_h(Student&A,Student&B){if(A.score!=B.score)returnA.score>B.score;elsereturnA.id<B.id;}boolcmp_l(...
#define _CRT_SECURE_NO_WARNINGS 1#include<iostream>#include<string>#include<cstring>using namespace std;const int N = 80;int main(void){char s[N], t[N];scanf("%s%s", s, t);printf("%s", s);cout << s << " " << t << endl;cout << strlen(s) << " " << strlen(t) <...
#include <cstring> #include <algorithm> #include <cmath> #include #include <vector> using namespace std; map<string, int> cnt;//统计可转变字符的出现次数 vector<string> words;//保存原先字符的大小写 //将每个单词化为字符层进行排序,这个思想可以省去排列的考虑,解题关键 string repr(const strin...
//v.erase(unique(v.begin(), v.end()), v.end()); // 2. non-sorted - 非排序 for (vector<CString>::iterator it = v.begin(); it != v.end(); ++it) v.erase(remove(it + 1, v.end(), *it), v.end()); // print out - 输出 for (vector<CStri...
1 #include <vector> 2 #include <cstdio> 3 #include <cstring> 4 #include <iostream> 5 #include <algorithm> 6 using namespace std; 7 const int N=100010; 8 vector<int>v[N*2]; 9 int n,ans,k,p,sum[N]; 10 bool cmp(int x,int y) { return abs(x*2-k)<abs(y*2-k); } ...
#define_CRT_SECURE_NO_WARNINGS#include<iostream>#include<stdio.h>#include<cstring>#if_MSC_VER#definesnprintf _snprintf#endifusingnamespacestd;longget_a_target_long() {/***变量声明***/longtarget =0;/***/cout<<"targer (0~"<< RAND_MAX <<"):"; cin>>target;returntarget; }stringget_a...
CString szMatchStr; } FindStr; typedef FindStr* LPFINDSTR; 然后处理条件判断: class FindMatchingString : public std::unary_function { public: FindMatchingString(const LPFINDSTR lpFS) : m_lpFS(lpFS) {} bool operator()(CString& szStringToCompare) const { ...
可以的，使用STL提供的sort方法就可以，包含<algorithm> sort(vec.begin(), vec.end(), cmp);bool cmp(const CRoomInfo& room1, const CRoomInfo& room2){ return room1.roomnum < room2.roomnum;}