盖亚！我太难了
原题链接：367.超过一半的数
2023-07-18 19:56:35
发布于：上海
全部评论 8
na
na
na\na
na
na
na
na
na
na
na
na
na
na
na
na
na
na
na
na
na
na
na
na
na\展开全部
1周前 来自 江苏
0#include <algorithm>
#include<bits/stdc++.h>
#include <iostream>
using namespace std;
int main(){
short n;
cin>>n;
short x;
short s[1000000]={0};
for(short i=0;i<n;i++){
cin>>x;
s[x];
}cout<<max_element(s,s+1000000)-s;
return 0;
}#include <algorithm>
#include<bits/stdc.h>
#include <iostream>
using namespace std;
int main(){
short n;
cin>>n;
short x;
short s[1000000]={0};
for(short i=0;i<n;i++){
cin>>x;
s[x];
}cout<<max_element(s,s+1000000)-s;
return 0;
}#include <algorithm>
#include<bits/stdc.h>
#include <iostream>
using namespace std;
int main(){
short n;
cin>>n;
short x;
short s[1000000]={0};
for(short i=0;i<n;i++){
cin>>x;
s[x];
}cout<<max_element(s,s+1000000)-s;
return 0;
}#include <algorithm>
#include<bits/stdc.h>
#include <iostream>
using namespace std;
int main(){
short n;
cin>>n;
short x;
short s[1000000]={0};
for(short i=0;i<n;i++){
cin>>x;
s[x];
}cout<<max_element(s,s+1000000)-s;
return 0;
}#include <algorithm>
#include<bits/stdc.h>
#include <iostream>
using namespace std;
int main(){
short n;
cin>>n;
short x;
short s[1000000]={0};
for(short i=0;i<n;i++){
cin>>x;
s[x]++;
}cout<<max_element(s,s+1000000)-s;
return 0;
}1周前 来自 江苏
0
有帮助，赞一个