-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathMissing_Coin_Sum.cpp
80 lines (64 loc) · 1.62 KB
/
Missing_Coin_Sum.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
#include <bits/stdc++.h>
#define endl "\n"
#define ll long long int
#define inf 1000000000000000001;
// #define mem(a,val) memset(a,val,sizeof(a))
using namespace std;
ll gcd(ll a, ll b){if (b == 0)return a;return gcd(b, a % b);} //__gcd
ll lcm(ll a, ll b){return (a/gcd(a,b)*b);}
long long mod = 1e9 + 7;
// Operator overloads
template<typename T> // cin >> vector<T>
istream& operator>>(istream &istream, vector<T> &v){for (auto &it : v)cin >> it;return istream;}
template<typename T> // cout << vector<T>
ostream& operator<<(ostream &ostream, const vector<T> &c) { for (auto &it : c) cout << it << " "; return ostream; }
/////////////////////////////////////////////////////////
// int powerof2(int x){
// return (x && !(x & (x-1)));
// }
bool cmp(pair<char, int> a, pair<char, int> b){
if(a.second == b.second){
return a.first > b.first;
}
return a.second > b.second;
}
bool comp(pair<char, int> a, pair<char, int> b){
if(a.first == b.first){
return a.second < b.second;
}
return a.first < b.first;
}
void solve()
{
// https://cses.fi/problemset/result/9035118/
int n; cin >> n;
ll ans= 0;
vector<int> num(n); cin >> num;
sort(num.begin(), num.end());
for(int i = 0; i < n ;i++){
if(num[i] > ans+1){
cout << ans + 1 << endl;
return;
}
ans += num[i];
}
cout << ans + 1 << endl;
return;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r", stdin);
freopen("output.txt","w", stdout);
#endif
std::ios::sync_with_stdio(false);
// cin.tie(NULL);
// cout.tie(NULL);
// int T;
// cin>>T;
// cin.ignore(); // must be there when using getline(cin, s)
// while(T--){
solve();
// }
return 0;
}