Luck Balance

                            Solution in C :

In C :






#include<stdio.h>
 long int sort(int a[] ,int size,int k){
	
	int i,min,j,sum=0,t; 
	for(i=0;i<k;i++){
		min=i;
		
		for(j=i+1;j<size;j++){
			if(a[min]>a[j])
			min=j;
		}
		if(i!=min){
			t=a[i];
			a[i]=a[min];
			a[min]=t;
		}
		//printf("a[%d]=%d\n",i,a[i]);
	sum+=a[i];	
	}
	//printf("sum=%d\n",sum);
return sum;	
	
}
int main(){
	int n,k,i,t;
	long int l,sum1=0,sum2;
	int ar[100],arc=0;
	scanf("%d %d",&n,&k);
	for(i=0;i<n;i++){
		
		scanf("%ld %d",&l,&t);
		
		if(t==1)
		ar[arc++]=l;
		
		
		sum1+=l;
	}
	sum2=sort(ar,arc,arc-k);
	//	printf("sum1=%d\n",sum1);
	printf("%ld",(sum1- 2*(sum2)));
	
	return 0;
}
                        

                        Solution in C++ :

In  C  ++  :






#include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i = (a); i <= (b); ++i)
#define FORD(i,a,b) for(int i = (a); i >= (b); --i)
#define RI(i,n) FOR(i,1,(n))
#define REP(i,n) FOR(i,0,(n)-1)
#define mini(a,b) a=min(a,b)
#define maxi(a,b) a=max(a,b)
#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define sz(w) (int) w.size()
typedef vector<int> vi;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
const int inf = 1e9 + 5;
const int nax = 1e6 + 5;



int main() {
	int n, k;
	scanf("%d%d", &n, &k);
	int ans = 0;
	vi w;
	REP(i, n) {
		int a, b;
		scanf("%d%d", &a, &b);
		if(b == 0) ans += a;
		else w.pb(a);
	}
	sort(w.rbegin(), w.rend());
	REP(i, (int) w.size()) {
		if(i < k) ans += w[i];
		else ans -= w[i];
	}
	printf("%d\n", ans);
	return 0;
}
                    

                        Solution in Java :

In  Java :






import java.util.Arrays;
import java.util.Scanner;
public class LuckBalance {

    static class Contest implements Comparable<Contest> {
        int l,t;

        @Override
        public int compareTo(Contest o) {
            if(t == o.t) {
                return (this.l - o.l);
            }else {
                return -(this.t - o.t);
            }
        }
    }
    public static void main(String[] args) {
        int N, K;
        Scanner scanner = new Scanner(System.in);
        N = scanner.nextInt();
        K = scanner.nextInt();

        int total = 0;
        int t,l;
        Contest[] contests = new Contest[N];
        int importCnt = 0;
        for (int i = 0; i < N; i++) {

            l = scanner.nextInt();
            t = scanner.nextInt();
            total += l;
            if(t == 1) {
                importCnt++;
            }
            Contest contest = new Contest();
            contest.l = l;
            contest.t = t;

            contests[i] = contest;
        }

        Arrays.sort(contests);

        int winCnt = importCnt - K;
        if(winCnt <= 0) {
            System.out.println(total);
            return;
        }

        for (int i = 0; i < winCnt; i++) {
            total -= 2 * contests[i].l;
        }
        System.out.println(total);



    }
}
                    

                        Solution in Python : 
                            
In  Python3 :






N, K = map(int, input().strip().split())

luck = 0
important = []

for i in range(N):
    L, T = list(map(int, input().strip().split()))
    if T == 0:
        luck += L
    else:
        important.append(L)
        
for i in sorted(important, reverse=True):
    if K > 0:
        luck += i
        K -= 1
    else:
        luck -= i

print(luck)