-
Notifications
You must be signed in to change notification settings - Fork 0
/
reszta.cpp
58 lines (46 loc) · 1.17 KB
/
reszta.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
#include<bits/stdc++.h>
using namespace std;
vector<int> binsearch(int b, vector<int>nominaly){
int koniec = 1000001;
int pocz = 0;
while(koniec - pocz>1)
{
int sr = (koniec+pocz)/2;
if(sr>b){
koniec= sr;
} else{
pocz = sr;
}
}
vector<int>t;
for(pocz;pocz==1;pocz--){
t.push_back(nominaly[pocz]);
}
return t;
}
int main(){
int resztawymagana;
int liczbanominalow;
cin >> resztawymagana >> liczbanominalow;
vector<int> nominaly;
int temp;
for(int i = 0;i<liczbanominalow;i++){
cin >> temp;
nominaly.push_back(temp);
}
bool m = false;
for (const auto &i: nominaly){
sort(nominaly.begin(), nominaly.end());}
nominaly = (resztawymagana,nominaly);
int reszta = 0;
int s = 0;
vector<int> templista1;
vector<int> templista2;
templista1.push_back(0);
templista2.push_back(nominaly[0]);
for(int i = 1;i<liczbanominalow;i++){
long long r = max(templista1[i-1],templista2[i-1]);
long long e = templista1[i-1]+nominaly[i];
templista1.push_back(r);
templista2.push_back(e);
}