CodeForces A. Meeting of Old Friends

2019-05-30

20:19:57

加油！！！

sort(a + 1, a + 5);

卡了一会儿

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main()
{
    ll a[5], e;
    ll sum = 0;
    for (int i = 1; i <= 4; i++)
    {
        scanf("%lld ", &a[i]);
    }
    scanf("%lld", &e);
    if (a[2] < a[3] || a[4] < a[1])
    {
        cout << 0;
        return 0;
    }
    else
    {
        sort(a + 1, a + 5);
        sum = a[3] - a[2] + 1;
        if (e >= a[2] && e <= a[3])
        {
            sum--;
        }
        cout << sum << endl;
    }
    
    return 0;
}