zoukankan      html  css  js  c++  java
  • CF div2 322 A

    A. Vasya the Hipster
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    One day Vasya the Hipster decided to count how many socks he had. It turned out that he had a red socks and b blue socks.

    According to the latest fashion, hipsters should wear the socks of different colors: a red one on the left foot, a blue one on the right foot.

    Every day Vasya puts on new socks in the morning and throws them away before going to bed as he doesn't want to wash them.

    Vasya wonders, what is the maximum number of days when he can dress fashionable and wear different socks, and after that, for how many days he can then wear the same socks until he either runs out of socks or cannot make a single pair from the socks he's got.

    Can you help him?

    Input

    The single line of the input contains two positive integers a and b (1 ≤ a, b ≤ 100) — the number of red and blue socks that Vasya's got.

    Output

    Print two space-separated integers — the maximum number of days when Vasya can wear different socks and the number of days when he can wear the same socks until he either runs out of socks or cannot make a single pair from the socks he's got.

    Keep in mind that at the end of the day Vasya throws away the socks that he's been wearing on that day.

    Sample test(s)
    Input
    3 1
    Output
    1 1
    Input
    2 3
    Output
    2 0
    Input
    7 3
    Output
    3 2
    Note

    In the first sample Vasya can first put on one pair of different socks, after that he has two red socks left to wear on the second day.

    好水~~~~

     1 #include <cstdio>
     2 #include <cstring>
     3 #include <iostream>
     4 #include <stack>
     5 #include <queue>
     6 #include <map>
     7 #include <algorithm>
     8 #include <vector>
     9 #include <cmath>
    10 
    11 using namespace std;
    12 
    13 const int maxn = 1000005;
    14 
    15 typedef long long LL;
    16 
    17 vector<int>G[maxn];
    18 
    19 int a[maxn];
    20 int res[maxn];
    21 
    22 
    23 int main()
    24 {
    25     int n,m;
    26     int tmp = 0;
    27     int a,b;
    28     scanf("%d%d",&a,&b);
    29     printf("%d %d
    ",min(a,b),abs(a-b)/2);
    30 
    31     return 0;
    32 }
    View Code
  • 相关阅读:
    多表联查统计数字
    在null情况下判断
    一个搜索框实现同一表内多个属性的搜索
    分页固定显示信息数
    git常用命令
    java 常用知识点
    Win10 系统直接在目录下打开cmd
    Linux环境 通过sftp启动jar包
    使用Navicat导出可执行脚本 SqlServer数据库某表的部分数据
    C#常用快捷键
  • 原文地址:https://www.cnblogs.com/lmlyzxiao/p/4846102.html
Copyright © 2011-2022 走看看