Rezolvare BAC Informatica 2009 – Varianta 42 – Subiectul al III-lea problema 3
Mai jos puteti gasi rezolvarea problemei 3 de la subiectul III din varianta 42 pentru examenul de bacalaureat din anul 2009
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <iostream.h> | |
| int p(int n, int k, int a[100]) { | |
| int gata, aux, i, s = 0; | |
| do { | |
| gata = 1; | |
| for (i = 1; i < n; i++) | |
| if (a[i] < a[i + 1]) { | |
| aux = a[i]; | |
| a[i] = a[i + 1]; | |
| a[i + 1] = aux; | |
| gata = 0; | |
| } | |
| } while (!gata); | |
| for (i = 1; i <= k; i++) | |
| s += a[i]; | |
| return s; | |
| } | |
| void main() { | |
| int n, k, a[100], i; | |
| cin >> n >> k; | |
| for (i = 1; i <= n; i++) | |
| cin >> a[i]; | |
| cout << p(n, k, a); | |
| } |
by Spor la lucru! Daca aveti intrebari nu ezitati sa le lasati in comentarii, va vom raspunde cat de repede putem 
int p(int v[100], int n, int k)
{
int maxim=0;
for(int i=n;i>0;i++)
{
if(maxim>n;
cin>>k;
for(int i=0;i>v[i];
cout<<p(v,n,k);
}
int maxim=0;
for(int i=n;i>0;i++)
{
if(maxim<v[i] && k!=0)
{
v[i]=maxim;
s=v[i]+maxim;
k–;
}
}
return s;