Gym 101149E The Best among Equals 简单遍历

最新推荐文章于 2019-08-06 19:50:09 发布

chudongfang2015

最新推荐文章于 2019-08-06 19:50:09 发布

阅读量1.1k

点赞数

分类专栏：算法 codeforces Codeforces刷题之旅文章标签： codeforces

本文链接：https://blog.csdn.net/chudongfang2015/article/details/53105662

版权

算法同时被 3 个专栏收录

116 篇文章 1 订阅

订阅专栏

codeforces

80 篇文章 0 订阅

订阅专栏

Codeforces刷题之旅

77 篇文章 2 订阅

订阅专栏

E - The Best among Equals

Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u

Submit Status Practice Gym 101149E

Description

standard input/output
Statements

A university in Samara has held a qualification contest in figure programming, but the jury can't come to terms how many teams should take part in the next stage of the contest. In figure programming a judge system doesn't evaluate the scores precisely and just set an interval which the score can belong to. Jury is able to evaluate any participant with any score from this interval. There are n teams that took part in the contest, and the i-th of them has the score in the interval from l_i to r_i, inclusively. Jury wants the number of qualified teams to be as large as possible, but they have to get the maximal score among all teams. What is the maximal number of teams that can take part in the next stage of the contest under such circumstances?

Input

The first line contains a single integer n (1 ≤ n ≤ 2·10⁵) — the number of teams in the contest.

Each of the next n lines contains two space-separated integers: l_i and r_i ( - 10⁹ ≤ l_i ≤ r_i ≤ + 10⁹) — the lower and upper bounds of the score for the i-th team.

Output

Output a single integer — the maximal number of teams that can get the maximal score.

Sample Input

Input

Output

先求左端最大，然后求有几个超过右端的数。

#include <iostream> 
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <list>
#define rep(i,m,n) for(i=m;i<=n;i++)
#define rsp(it,s) for(set<int>::iterator it=s.begin();it!=s.end();it++)
const int inf_int = 2e9;
const long long inf_ll = 2e18;
#define inf_add 0x3f3f3f3f
#define mod 1000000007
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pi acos(-1.0)
#define pii pair<int,int>
#define Lson L, mid, rt<<1
#define Rson mid+1, R, rt<<1|1
const int maxn=5e2+10;
using namespace std;
typedef  long long ll;
typedef  unsigned long long  ull; 
inline int read(){int ra,fh;char rx;rx=getchar(),ra=0,fh=1;
while((rx<'0'||rx>'9')&&rx!='-')rx=getchar();if(rx=='-')
fh=-1,rx=getchar();while(rx>='0'&&rx<='9')ra*=10,ra+=rx-48,
rx=getchar();return ra*fh;}
//#pragma comment(linker, "/STACK:102400000,102400000")
ll gcd(ll p,ll q){return q==0?p:gcd(q,p%q);}
ll qpow(ll p,ll q){ll f=1;while(q){if(q&1)f=f*p;p=p*p;q>>=1;}return f;}
int dir[4][2] = {{1,0},{-1,0},{0,1},{0,-1}};


ll n,a[200005],t,re = 0;
int main()
{
    memset(a,0,sizeof(a));
    cin >> n;
    for(int i=1;i<=n;i++)
    {
    	cin >> a[i];
	}
	re += a[1];
	for(int i=2;i<=n;i++)
	{
		if(a[i]>a[i-1])
		{
			re += a[i]-a[i-1];
		}
	}
	cout << re <<endl; 
	return 0;
}