テキトーなメモ帳

テキトーなメモ帳

AOJ:0238 Time to Study

問題文通りにやるだけです。

#define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <cstdio>
#include <iostream>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#include <list>
#include <cctype>
#include <utility>
 
using namespace std;
 
typedef long long ll;
typedef pair <int,int> P;
typedef pair <int,P> PP;
 
int tx[] = {0,1,0,-1};
int ty[] = {-1,0,1,0};
 
static const double EPS = 1e-8;
 
int main(){
    int duration;
    while(~scanf("%d",&duration)){
        if(duration == 0) break;
        int n;
        scanf("%d",&n);
 
        int sum = 0;
        for(int i=0;i<n;i++){
            int a,b;
            scanf("%d %d",&a,&b);
            sum += b - a;
        }
 
        if(sum >= duration) printf("OK\n"); 
        else printf("%d\n",duration - sum); 
    }
}