Pagini recente » Cod sursa (job #1936989) | Cod sursa (job #835649) | Cod sursa (job #2677037) | Cod sursa (job #2974664) | Cod sursa (job #190428)
Cod sursa(job #190428)
#include<iostream.h>
void main()
{int long m=0,n=0,a[100],q=0,s=0,i=0,j=0;
cout<<"n=";
cin>>n;
cout<<"m=";
cin>>m;
for(i=1;i<=n;i++)
cin>>a[i];
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
if(a[i]<=a[j])
{q=a[i];
a[i]=a[j];
a[j]=q;}
for(i=1;i<=n;i++)
{
if(a[i]==a[i+1])
a[i]=a[i+1];
i--;
n--;}
if(m>n) cout<<"imposibil";
else
for(i=1;i<=m;i++)
s=s+a[i];
cout<<s; }