属于C++的题解

一眼结构体
先说一下做法：用结构体储存每一个数字的出现次数，之后sort
代码：
ddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd
ddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd
ddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd
ddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd

#include<algorithm>/*此题解仅供参考，不许抄袭*/
#include<cstdio>
#define int long long
#define scanf cin
#define printf cout
using namespace std;
struct number{
    int num,sum;
}a[81];
bool cmp(number a,number b){
    if(a.sum!=b.sum)return a.sum>b.sum;
    else return a.num<b.num;
}
int main(){
    int s1,s2,s3;
    scanf("%d%d%d",&s1,&s2,&s3);
    for(int i=1;i<=s1;i++){
        for(int j=1;j<=s2;j++){
            for(int k=1;k<=s3;k++){
                a[i+j+k].num=i+j+k;
                a[i+j+k].sum++;
            }
        }
    }
    sort(a,a+s1+s2+s3,cmp);
    printf("%d",a[0].num);
}

应该没人用cstdio吧
${\color{white}\colorbox{white}{三行define防抄袭}}$