Răspuns :
#include <iostream>
#define nmax 10005
using namespace std;
int i,v[nmax],s,x,nr;
int main()
{
for(i=1;i<=5;i++)
{
cin>>x;
v[x]=1;
}
for(i=10000;i>=1;i--)
if((v[i]==1)&&(nr<3))
{
s=s+i;
nr++;
}
cout<<s;
return 0;
}
#define nmax 10005
using namespace std;
int i,v[nmax],s,x,nr;
int main()
{
for(i=1;i<=5;i++)
{
cin>>x;
v[x]=1;
}
for(i=10000;i>=1;i--)
if((v[i]==1)&&(nr<3))
{
s=s+i;
nr++;
}
cout<<s;
return 0;
}
#include <iostream>
#define MAX 10002
using namespace std;
unsigned v[MAX];
int main(){
unsigned a,b,c,d,e,p=3,s=0;
cin>>a>>b>>c>>d>>e;
v[a]++; v[b]++; v[c]++; v[d]++; v[e]++;
for(int i=10000;i>=1 && p!=0;i--)
if(v[i]!=0){
s+=i;
p--;
}
cout<<s;
return 0;
}
Acesta este un mod de a rezolva, mai sunt si altele. Succes!
#define MAX 10002
using namespace std;
unsigned v[MAX];
int main(){
unsigned a,b,c,d,e,p=3,s=0;
cin>>a>>b>>c>>d>>e;
v[a]++; v[b]++; v[c]++; v[d]++; v[e]++;
for(int i=10000;i>=1 && p!=0;i--)
if(v[i]!=0){
s+=i;
p--;
}
cout<<s;
return 0;
}
Acesta este un mod de a rezolva, mai sunt si altele. Succes!