Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cmath>
- using namespace std;
- int n,a[10000],S=0,x=0,k;
- void citire()
- {
- cin>>n;
- for(int i=1;i<=n;i++)
- cin>>a[i];
- cin>>k;
- }
- int sortare(int st, int dr)
- {
- int aux,i,j,di,dj;
- di=0;dj=1;i=st;j=dr;
- while(i<j)
- {
- if(a[i]>a[j])
- {
- aux=a[i];
- a[i]=a[j];
- a[j]=aux;
- aux=di;
- di=dj;
- dj=aux;
- }
- i=i+di;
- j=j-dj;
- }
- return i;
- }
- void quick(int st, int dr)
- {
- int p;
- if(st<dr)
- {
- p=sortare(st,dr);
- quick(st,p-1);
- quick(p+1,dr);
- }
- }
- void rezolvare()
- {
- int i=1;
- int x=k;
- while(k!=0)
- {
- if(a[i]<0)
- a[i]=abs(a[i]);
- else
- if(a[i]>0)
- a[i]=-abs(a[i]);
- i+=1;
- k-=1;
- }
- long long S=0;
- for(int i=1;i<=n;i++)
- S+=a[i];
- cout<<S;
- }
- int main()
- {
- citire();
- quick(1,n);
- rezolvare();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement