//https://www.acmicpc.net/problem/9465 #include #include using namespace std;int score[2][100001];int dp[2][100001];int main(){ int t; cin >> t; for(int tc=0; tc> n; for(int i=1; i> score[0][i]; for(int i=1; i> score[1][i]; dp[0][1]=score[0][1]; dp[1][1]=score[1][1]; dp[0][2]=score[1][1]+score[0][2]; dp[1][2]=score[0][1]+score[1][2]; for(int i=2; i
//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/1920 #include #include using namespace std;int A[100001]; bool find_x(int x,int start, int end){ int m; while(end-start>=0){ m=(end+start)/2; if(A[m]==x) return true; if(A[m]
#include using namespace std; class func{ int A,B,C; public : void input(){ cin >> A >> B >> C; } void operation(){ cout