左移运算符的优先级问题

German Collegiate Programming Contest 2019

H题：Jazz Enthusiast
输入两个数n1,n2;
题目大意是输入n1个时间（例如14分25秒是14:25,1小时是1:00:00,不是那种标准的24小时计时法）代表歌单内歌曲的时长，说是听歌的人喜欢把一首歌临近结束的n2秒剪掉，让你编一个程序决定他剪掉时间后还能听多长时间，最后一首歌结尾不剪掉

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
using namespace std;
typedef long long ll;
typedef struct {
   

	ll h;
	ll m;
	ll s;

}TIME;
ll read() {
   //练习输入挂

	char n;
	ll ret = 1;
	while (1) {
   
		n = getchar();
		if (n == '-') {
   
			ret = -1;
			continue;
		}
		if (isdigit(n)) {