排序用的
by zMinYu @ 2023-07-06 10:11:19
@[Qiuxi](/user/976976) 排序用的。。有升序，降序
by Weizhuo_Zhao @ 2023-07-06 10:16:57
@[Weizhuo_Zhao](/user/681558)
抱歉，我好像还是没懂……
（嘤嘤嘤~~~
by Qiuxi @ 2023-07-06 10:18:51
@[Qiuxi](/user/976976)
```cpp
//sort(begin,end)，表示一个范围，例子：
#include <algorithm>
int main()
{
int a[20]={},i;
for(i=0;i<20;i++)
cout<<a[i]<<endl;
sort(a,a+20);
return 0;
}
```
升序，运行一下自然懂
by Weizhuo_Zhao @ 2023-07-06 10:22:27
这道题也很简单AC:
```cpp
#include <map>
#include <iostream>
using namespace std;
int main() {
map<long long, long long>map_1;
long long N, C, a[200005] = {}, num = 0;
cin >> N >> C;
for (int i = 1; i <= N; i++) {
cin >> a[i];
map_1[a[i]]++;
}
for (int i = 1; i <= N; i++) {
num += map_1[C + a[i]];
}
cout << num;
return 0;
}
```
不要举报！！！
map STL输入可以直接排序！
by Weizhuo_Zhao @ 2023-07-06 10:24:58
@[Qiuxi](/user/976976) [可以看一下](https://oi-wiki.org//basic/stl-sort/#stdsort)
by wYYSZLwSSY @ 2023-07-06 10:25:53
我有个小问题看你可以不可以看出来
[B2052 简单计算器](https://www.luogu.com.cn/problem/https://www.luogu.com.cn/problem/B2052)
```cpp
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
char o;
cin>>a>>b>>o;
if(o=='+'){
cout<<a+b;
}
if(o=='-'){
cout<<a-b;
}
if(o=='*'){
cout<<a*b;
}
if(o=='/'){
if(b==0){
cout<<"Divided by zero!";
}
else{
cout<<a/b;
}
}
else{
cout<<"Invalid operator!";
}
return 0;
}
```
by Weizhuo_Zhao @ 2023-07-06 10:27:22
@[wYYSZLwSSY](/user/297683) 还有STL的map
by Weizhuo_Zhao @ 2023-07-06 10:28:33
@[Weizhuo_Zhao](/user/681558)
谢谢，AC了
by Qiuxi @ 2023-07-06 10:30:24
@[Qiuxi](/user/976976) 不用谢，互关吧
by Weizhuo_Zhao @ 2023-07-06 10:31:27