题解 | 小红的不动点分配
小红的不动点分配
https://www.nowcoder.com/practice/9af88720190248d5a8dc3cebdf050b21
#include<bits/stdc++.h>
using namespace std;
int arr[200086];
int ans;
int main() {
int n;
cin >> n;
for (int i = 1; i <= 2 * n; i++) {
int x;
scanf("%d", &x);
arr[x]++;
}
for (int i = 0; i <= n; i++) {
if (arr[i] >= 2)ans = ans + 2;
else if (arr[i] == 1)ans++;
}
cout << ans;
return 0;
}
OPPO公司福利 1225人发布


查看1道真题和解析