//https://www.acmicpc.net/problem/1931 #include #include #include using namespace std;#define lli long long int int main() { int n; cin >> n; vector arr; for(int i=0; i> a >> b; arr.push_back(pair(b,a)); } sort(arr.begin(), arr.end()); int cnt=1; int end=arr[0].first; for(int i=1; i
//https://www.acmicpc.net/problem/11047#include using namespace std;int money[10]; int main() { int n,K,ans; cin >> n >> K; for(int i=0; i> money[i]; ans=0; for(int i=n-1; i>=0; i--) { if((K/money[i]) >0) ans+=K/money[i]; K%=money[i]; } cout
//https://www.acmicpc.net/problem/2217#include #include using namespace std; int main() { int n,tmp; int rope[100001]; int ans=0; cin >> n; for(int i=1; i> rope[i]; sort(rope+1, rope+n+1); for(int i=1; i
//https://www.acmicpc.net/problem/11399#include #include using namespace std;int time1[1000]; int main() { int n,ans; cin >> n; for(int i=0; i> time1[i]; sort(time1, time1+n); ans=0; for(int i=0; i
