zoukankan      html  css  js  c++  java
  • codeforces 480A A. Exams(贪心)

    题目链接:

    A. Exams

    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Student Valera is an undergraduate student at the University. His end of term exams are approaching and he is to pass exactly nexams. Valera is a smart guy, so he will be able to pass any exam he takes on his first try. Besides, he can take several exams on one day, and in any order.

    According to the schedule, a student can take the exam for the i-th subject on the day number ai. However, Valera has made an arrangement with each teacher and the teacher of the i-th subject allowed him to take an exam before the schedule time on day bi(bi < ai). Thus, Valera can take an exam for the i-th subject either on day ai, or on day bi. All the teachers put the record of the exam in the student's record book on the day of the actual exam and write down the date of the mark as number ai.

    Valera believes that it would be rather strange if the entries in the record book did not go in the order of non-decreasing date. Therefore Valera asks you to help him. Find the minimum possible value of the day when Valera can take the final exam if he takes exams so that all the records in his record book go in the order of non-decreasing date.

    Input

    The first line contains a single positive integer n (1 ≤ n ≤ 5000) — the number of exams Valera will take.

    Each of the next n lines contains two positive space-separated integers ai and bi (1 ≤ bi < ai ≤ 109) — the date of the exam in the schedule and the early date of passing the i-th exam, correspondingly.

    Output

    Print a single integer — the minimum possible number of the day when Valera can take the last exam if he takes all the exams so that all the records in his record book go in the order of non-decreasing date.

    Examples
    input
    3
    5 2
    3 1
    4 2
    output
    2
    input
    3
    6 1
    5 2
    4 3
    output
    6

    题意:

    每课有两次考试时间,老师会按时间靠后的那个记录,要求老师记录的时间不能下降,问你最少需要多少天才能考完;

    思路:

    b作为第一关键字,a作为第二关键字,从小到大排序,然后贪心;

    AC代码:

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    #include <cmath>
    #include <bits/stdc++.h>
    #include <stack>
    #include <map>
      
    using namespace std;
      
    #define For(i,j,n) for(int i=j;i<=n;i++)
    #define mst(ss,b) memset(ss,b,sizeof(ss));
      
    typedef  long long LL;
      
    template<class T> void read(T&num) {
        char CH; bool F=false;
        for(CH=getchar();CH<'0'||CH>'9';F= CH=='-',CH=getchar());
        for(num=0;CH>='0'&&CH<='9';num=num*10+CH-'0',CH=getchar());
        F && (num=-num);
    }
    int stk[70], tp;
    template<class T> inline void print(T p) {
        if(!p) { puts("0"); return; }
        while(p) stk[++ tp] = p%10, p/=10;
        while(tp) putchar(stk[tp--] + '0');
        putchar('
    ');
    }
      
    const LL mod=1e9+7;
    const double PI=acos(-1.0);
    const int inf=1e9;
    const int N=1e6+20;
    const int maxn=5e3+10;
    const double eps=1e-12;
     
    pair<int,int>ha[maxn];
    
    int cmp(pair<int,int> x,pair<int,int> y)
    {
        if(x.first==y.first)return x.second<y.second;
        return x.first<y.first;
    }
    int main()
    {
        int n;
        read(n);
        For(i,0,n-1)
        {
            read(ha[i].first);
            read(ha[i].second);
        }
        sort(ha,ha+n,cmp);
        int ans=0;
        for(int i=0;i<n;i++)
        {
            int temp=min(ha[i].first,ha[i].second);
            if(temp<ans)temp=max(ha[i].first,ha[i].second);
            ans=temp;
        }
        cout<<ans<<endl;
        return 0;
    }
    

      

  • 相关阅读:
    【Demo 0062】文件遍历
    【Demo 0068】获取分区信息
    【Demo 0060】记录个人信息
    【Demo 0069】文件读写
    【Demo 0064】监控文件/目录变更
    【Demo 0067】文件类型关联图标
    【Demo 0065】获取被修改的文件/目录
    【Demo 0062】目录及文件基本操作
    【Demo 0061】打开与保存文件
    【Demo 0066】监控被变更文件/目录(完成端口)
  • 原文地址:https://www.cnblogs.com/zhangchengc919/p/5843872.html
Copyright © 2011-2022 走看看