171230_2217_로프
//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/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
//https://www.acmicpc.net/problem/2167 #include using namespace std;int arr[301][301]; int main(){ int n, m, k, dp; cin >> n >> m; for(int i=1; i arr[i][j]; cin >> k; for(int a=0; a> i >> j >> x >> y; int sum=0; for(int b=i; b
//https://www.acmicpc.net/problem/2563#include using namespace std;bool paper[100][100]; int main(){ int n,ans,x,y; cin >> n; ans=0; for(int i=0 ; i> x >> y; for(int j=0; j