From b66eedc1b369c19687c47ee6e0f29974b3c66a1d Mon Sep 17 00:00:00 2001
From: Bidit Mangal <39191019+Biditmangal@users.noreply.github.com>
Date: Sat, 3 Oct 2020 15:14:54 +0530
Subject: [PATCH] Added some more solutions

Added some solutions that are missing in your list
---
 851A.cpp | 52 ++++++++++++++++++++++++++++++++++++++++++++++++++++
 873A.cpp | 53 +++++++++++++++++++++++++++++++++++++++++++++++++++++
 2 files changed, 105 insertions(+)
 create mode 100644 851A.cpp
 create mode 100644 873A.cpp

diff --git a/851A.cpp b/851A.cpp
new file mode 100644
index 0000000..f15400a
--- /dev/null
+++ b/851A.cpp
@@ -0,0 +1,52 @@
+#include <math.h>
+#include <time.h>
+#include <ctype.h>
+#include <stdio.h>
+#include <assert.h>
+#include <stdlib.h>
+#include <string.h>
+#include <map>
+#include <set>
+#include <deque>
+#include <queue>
+#include <stack>
+#include <bitset>
+#include <string>
+#include <vector>
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+
+#define sp system("pause")
+#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 REP(i,n) FOR(i,0,(int)n-1)
+#define pb(x) push_back(x)
+#define mp(a,b) make_pair(a,b)
+#define MS0(x) memset(x,0,sizeof(x))
+#define MS1(x) memset(x,1,sizeof(x))
+#define SORT(a,n) sort(begin(a),begin(a)+n)
+#define REV(a,n) reverse(begin(a),begin(a)+n)
+#define ll long long
+#define pii pair<int,int>
+#define MOD 1000000007
+
+//int a[100000];
+
+int main(){
+
+	int n,k,t;
+	cin>>n>>k>>t;
+
+	if(t<k){
+		cout<<t<<endl;
+	}
+	else if(t<=n && t>=k){
+		cout<<k<<endl;
+	}
+	else{
+		cout<<n+k-t<<endl;
+	}
+	return 0;
+}
diff --git a/873A.cpp b/873A.cpp
new file mode 100644
index 0000000..f5c6fb5
--- /dev/null
+++ b/873A.cpp
@@ -0,0 +1,53 @@
+#include <math.h>
+#include <time.h>
+#include <ctype.h>
+#include <stdio.h>
+#include <assert.h>
+#include <stdlib.h>
+#include <string.h>
+#include <map>
+#include <set>
+#include <deque>
+#include <queue>
+#include <stack>
+#include <bitset>
+#include <string>
+#include <vector>
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+
+#define sp system("pause")
+#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 REP(i,n) FOR(i,0,(int)n-1)
+#define pb(x) push_back(x)
+#define mp(a,b) make_pair(a,b)
+#define MS0(x) memset(x,0,sizeof(x))
+#define MS1(x) memset(x,1,sizeof(x))
+#define SORT(a,n) sort(begin(a),begin(a)+n)
+#define REV(a,n) reverse(begin(a),begin(a)+n)
+#define ll long long
+#define pii pair<int,int>
+#define MOD 1000000007
+
+int a[101];
+
+int main(){
+
+	int n,k,x;
+	cin>>n>>k>>x;
+	int sum=0;
+	REP(i,n){
+		cin>>a[i];
+	}
+	SORT(a,n);
+	REP(i,n-k){
+		sum+=a[i];
+	}
+	sum = sum + k*x;
+	cout<<sum;
+
+	return 0;
+}