RAMA AND FRIEND SPOJ SOLUTION

 /* RAMA AND FRIEND SOLUTION */
#include<bits/stdc++.h>
                                                using namespace std;
int main()
{
int t,i;
cin>>t;
while(t--)
{
int n,s=0,k;
cin>>n>>k;
int a[n];
for(i=0;i<n;i++)
cin>>a[i];
while(k--)
{
a[0]*=(-1);
sort(a,a+n);
}
for(i=0;i<n;i++)
{s+=a[i];}
cout<<s<<"\n";
}
return 0;
}

Comments

Post a Comment

Popular posts from this blog

TDPRIMES SPOJ SOLUTION

/* PRINTING SOME PRIMES SPOJ SOLUTION*/ #include<bits/stdc++.h> using namespace std; vector <bool> v(100000000,true); int arr[8000000]; int main() {     long long int n = 100000000;     long int i,j ;     v[1] = false;     v[0] = false;     for(i=4;i<=n;i+=2)      v[i]=false;       for(i=3;i*i<=n;i+=2)      {            if(v[i])              {                 for(j=i*i;j<=n;j=j+(2*i))                 v[j] = false;              }      }        j=0;        arr[0] = 2;        for(i=3;i<=n;i+=2)       {         if(v[i])         arr[++j]=i;        }        for(i=1;i<=j;i+=100)       cout<<arr[i-1]<<"\n";       return 0;    }
Read more

Spoj CLOPPAIR Solution

This is the solution for spoj Closest Point Pair  #include<bits/stdc++.h>  using namespace std;  #define mn 9999999999.9  struct point  {       long double x,y;       int index;  };  point makepoint(double a,double b,int i) {       point temp;     temp.x=a;temp.y=b;temp.index=i;       return temp; }        double dist(point p1,point p2)  {      return sqrt((p1.x-p2.x)*(p1.x-p2.x) + (p1.y-p2.y)*(p1.y-p2.y));  }  bool compareX(point a,point b) {     return a.x < b.x; } bool compareY(point a,point b) {     return a.y < b.y; }  int indexa,indexb; double ans=999999999; double bruteforce(point p[],int n) {   double d=mn;  for( int i=0;i<n;i++)  {    for(int j=i+1;j<n;j++)   {      double dtemp=dist(p[i],p[j]);         if(dtemp<d)       {          d=dtemp;          if(d < ans)          {            ans=d;            indexa= p[i].index;      
Read more