[softeer] GBC

https://softeer.ai/practice/info.do?idx=1&eid=584&sw_prbl_sbms_sn=205261 

Softeer

---

단순구현

c++

#include <iostream>

using namespace std;

int main(){
  int n, m; cin >> n >> m;
  int answer = 0;
  int building[100];

  int length, v; // 각 구간의 길이와 속도
  int idx = 0;
  for(int i=0; i<n; i++){
    cin >> length; cin >> v;
    for(int j=idx; j<idx+length; j++) building[j] = v;
    idx += length;
  }

  idx = 0;
  for(int i=0; i<m; i++){
    cin >> length; cin >> v;
    for(int j=idx; j < idx+length; j++){
      if(building[j] < v){
        answer = answer > v-building[j] ? answer : v-building[j] ;
      }
    }
    idx += length; 
  }
  
  cout << answer;
  
  return 0;
}